Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
La logistisation du monde : Chroniques sur une révolution en cours / Nathalie Fabbe-Costes, Rouquet Aurélien
| La logistisation du monde : Chroniques sur une révolution en cours / Nathalie Fabbe-Costes, Rouquet Aurélien |
| Autore | Allègre Thierry |
| Pubbl/distr/stampa | Aix-en-Provence, : Presses universitaires de Provence, 2021 |
| Descrizione fisica | 1 online resource (334 p.) |
| Altri autori (Persone) |
BalamboAmine
BensalemAdib BohasAmélie BoissinotAline Bonet FernandezDominique BrionSébastien CammanChristelle CapoClaire Carneiro de Andrade FilhoJosé ChanutOdile Claye-PuauxSophie DescarpentriesStéphane DuarteNatalia DurandBruno El BahraouiHanane Fabbe-CostesNathalie FioreClaude FonsCendrine FulconisFrançois GodéCécile GoncalvesOlga GuarneriJean-Michel GuieuGilles GuillaumeJean-Philippe HuetJean-Michel JeanpertSophie Kacioui-MaurinÉlodie Khodadad SaryazdiAli KinVichara Koulikoff-SouvironMarie LambertFrançois-Michel LazzeriJennifer LivolsiLaurent MerminodNathalie MichonValérie MonnetMarlène MorelChristian MoulinsJean-Louis PachéGilles Pellegrin-RomeggioFrédéric PicardJean-Marie PoirelCarole RosenzweigAimé-Frédéric RouquetAurélien RoussatChristine RuffenachMarc SalaunVincent Sampieri-TeissierNathalie SirjeanStéphane TremeacYann ValetteVanessa VegaDiego XiangTingTing YaoYuan AurélienRouquet |
| Soggetto topico |
Economics
Business travail gouvernance logistique |
| ISBN | 979-1-03-656955-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Record Nr. | UNINA-9910496051803321 |
Allègre Thierry
|
||
| Aix-en-Provence, : Presses universitaires de Provence, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Organisation, information et performance : Les processus opérationnels au cœur de la gestion des entreprises / François Meyssonnier, Frantz Rowe
| Organisation, information et performance : Les processus opérationnels au cœur de la gestion des entreprises / François Meyssonnier, Frantz Rowe |
| Autore | Abbad Hicham |
| Pubbl/distr/stampa | Rennes, : Presses universitaires de Rennes, 2018 |
| Descrizione fisica | 1 online resource (266 p.) |
| Altri autori (Persone) |
AntheaumeNicolas
BagoullaCorinne BarbelivienDominique BarbuNoël BertrandThierry BidanMarc BréchetJean-Pierre BreteschéSophie BruzacVincent CorbièreFrançois de DariLaetitia DavidMickaël de CorbièreFrançois DurandBruno GeffroyBénédicte GuillouxVéronique HenrietBruno JaraMagali JourneBenoît JubinLoïc LairetGwenaëlle LauzanasJean-Marc LemarchandYannick LyonnetBarbara MevellecPierre MeyssonnierFrançois PerraudeauYves PopAdrian RaymondMyriam RobicPaulette RoweFrantz SenkelMarie-Pascale StimecArnaud TaharCaroline TillementStéphanie TougeronPierre-Yves WolffFrançois-Charles ZelinschiDragoş |
| Soggetto topico |
Management (General)
performance entreprise logistique pilotage |
| ISBN | 2-7535-7352-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Record Nr. | UNINA-9910495810903321 |
|
Abbad Hicham
|
||
| Rennes, : Presses universitaires de Rennes, 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2005 [[electronic resource] ] : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2004, Proceedings / / edited by Volker Diekert, Bruno Durand
| STACS 2005 [[electronic resource] ] : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2004, Proceedings / / edited by Volker Diekert, Bruno Durand |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 706 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Theory of Computation Data Science Discrete Mathematics in Computer Science Computer Graphics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Automorphisms of Finite Rings and Applications to Complexity of Problems -- Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages -- Algorithmics in Exponential Time -- Session 1A -- Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics -- Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms -- Truthful Approximation Mechanisms for Scheduling Selfish Related Machines -- Session 1B -- Counting in the Two Variable Guarded Logic with Transitivity -- The Variable Hierarchy of the ?-Calculus Is Strict -- The Core of a Countably Categorical Structure -- Session 2A -- How Common Can Be Universality for Cellular Automata? -- Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods -- Session 2B -- On the Decidability of Temporal Properties of Probabilistic Pushdown Automata -- Deciding Properties of Contract-Signing Protocols -- Session 3A -- Polylog-Time Reductions Decrease Dot-Depth -- On the Computational Complexity of the Forcing Chromatic Number -- More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP -- Session 3B -- Three Optimal Algorithms for Balls of Three Colors -- Cost Sharing and Strategyproof Mechanisms for Set Cover Games -- On Weighted Balls-into-Bins Games -- Session 4A -- Computing Minimal Multi-homogeneous Bézout Numbers Is Hard -- Dynamic Complexity Theory Revisited -- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size -- Session 4B -- Shortest Monotone Descent Path Problem in Polyhedral Terrain -- Packet Buffering: Randomization Beats Deterministic Algorithms -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time -- Session 5A -- Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms -- Regular Tree Languages Definable in FO -- Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations -- Session 5B -- Connectivity for Wireless Agents Moving on a Cycle or Grid -- Improved Algorithms for Dynamic Page Migration -- Approximate Range Mode and Range Median Queries -- Session 6A -- Topological Automata -- Minimizing NFA’s and Regular Expressions -- Session 6B -- Increasing Kolmogorov Complexity -- Kolmogorov-Loveland Randomness and Stochasticity -- Session 7A -- Information Theory in Property Testing and Monotonicity Testing in Higher Dimension -- On Nash Equilibria in Non-cooperative All-Optical Networks -- Speed Scaling to Manage Temperature -- Session 7B -- The Complexity of Solving Linear Equations over a Finite Ring -- A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields -- Characterizing TC0 in Terms of Infinite Groups -- Session 8A -- Fast Pruning of Geometric Spanners -- The PIGs Full Monty – A Floor Show of Minimal Separators -- Centrality Measures Based on Current Flow -- Session 8B -- Varieties of Codes and Kraft Inequality -- Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes -- The Power of Commuting with Finite Sets of Words -- Session 9A -- Exact Quantum Algorithms for the Leader Election Problem -- Robust Polynomials and Quantum Algorithms -- Quantum Interactive Proofs with Competing Provers -- Session 9B -- Roundings Respecting Hard Constraints -- Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves -- Cycle Cover with Short Cycles -- Session 10A -- A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs -- All-Pairs Nearly 2-Approximate Shortest-Paths in O(n 2 polylog n) Time -- Session 10B -- Pattern Occurrences in Multicomponent Models -- Automatic Presentations for Finitely Generated Groups. |
| Record Nr. | UNISA-996465942003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2004, Proceedings / / edited by Volker Diekert, Bruno Durand
| STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2004, Proceedings / / edited by Volker Diekert, Bruno Durand |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 706 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Theory of Computation Data Science Discrete Mathematics in Computer Science Computer Graphics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Automorphisms of Finite Rings and Applications to Complexity of Problems -- Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages -- Algorithmics in Exponential Time -- Session 1A -- Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics -- Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms -- Truthful Approximation Mechanisms for Scheduling Selfish Related Machines -- Session 1B -- Counting in the Two Variable Guarded Logic with Transitivity -- The Variable Hierarchy of the ?-Calculus Is Strict -- The Core of a Countably Categorical Structure -- Session 2A -- How Common Can Be Universality for Cellular Automata? -- Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods -- Session 2B -- On the Decidability of Temporal Properties of Probabilistic Pushdown Automata -- Deciding Properties of Contract-Signing Protocols -- Session 3A -- Polylog-Time Reductions Decrease Dot-Depth -- On the Computational Complexity of the Forcing Chromatic Number -- More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP -- Session 3B -- Three Optimal Algorithms for Balls of Three Colors -- Cost Sharing and Strategyproof Mechanisms for Set Cover Games -- On Weighted Balls-into-Bins Games -- Session 4A -- Computing Minimal Multi-homogeneous Bézout Numbers Is Hard -- Dynamic Complexity Theory Revisited -- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size -- Session 4B -- Shortest Monotone Descent Path Problem in Polyhedral Terrain -- Packet Buffering: Randomization Beats Deterministic Algorithms -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time -- Session 5A -- Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms -- Regular Tree Languages Definable in FO -- Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations -- Session 5B -- Connectivity for Wireless Agents Moving on a Cycle or Grid -- Improved Algorithms for Dynamic Page Migration -- Approximate Range Mode and Range Median Queries -- Session 6A -- Topological Automata -- Minimizing NFA’s and Regular Expressions -- Session 6B -- Increasing Kolmogorov Complexity -- Kolmogorov-Loveland Randomness and Stochasticity -- Session 7A -- Information Theory in Property Testing and Monotonicity Testing in Higher Dimension -- On Nash Equilibria in Non-cooperative All-Optical Networks -- Speed Scaling to Manage Temperature -- Session 7B -- The Complexity of Solving Linear Equations over a Finite Ring -- A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields -- Characterizing TC0 in Terms of Infinite Groups -- Session 8A -- Fast Pruning of Geometric Spanners -- The PIGs Full Monty – A Floor Show of Minimal Separators -- Centrality Measures Based on Current Flow -- Session 8B -- Varieties of Codes and Kraft Inequality -- Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes -- The Power of Commuting with Finite Sets of Words -- Session 9A -- Exact Quantum Algorithms for the Leader Election Problem -- Robust Polynomials and Quantum Algorithms -- Quantum Interactive Proofs with Competing Provers -- Session 9B -- Roundings Respecting Hard Constraints -- Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves -- Cycle Cover with Short Cycles -- Session 10A -- A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs -- All-Pairs Nearly 2-Approximate Shortest-Paths in O(n 2 polylog n) Time -- Session 10B -- Pattern Occurrences in Multicomponent Models -- Automatic Presentations for Finitely Generated Groups. |
| Record Nr. | UNINA-9910484929903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2006 [[electronic resource] ] : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas
| STACS 2006 [[electronic resource] ] : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIX, 714 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-540-32288-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem. |
| Record Nr. | UNISA-996466154303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2006 : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas
| STACS 2006 : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIX, 714 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-540-32288-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem. |
| Record Nr. | UNINA-9910768161803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||