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.
Algorithmic Aspects of Wireless Sensor Networks [[electronic resource] ] : 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009. Revised Selected Papers / / edited by Shlomi Dolev
| Algorithmic Aspects of Wireless Sensor Networks [[electronic resource] ] : 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009. Revised Selected Papers / / edited by Shlomi Dolev |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 263 p.) |
| Disciplina | 004n/a |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Computer programming
Computer networks Algorithms Computer engineering Electronic digital computers—Evaluation Software engineering Programming Techniques Computer Communication Networks Computer Engineering and Networks System Performance and Evaluation Software Engineering |
| ISBN | 3-642-05434-X |
| Classificazione |
DAT 250f
DAT 530f ELT 745f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Invited Talk I Actuator Nets: Folding, Reconfiguring and Deploying Sensors -- Invited Talk II The Power and Limitations of Simple Algorithms: A Partial Case Study of Greedy Mechanisim Design for Combinatorial Actions -- Sensor Field: A Computational Model -- Near-Optimal Radio Use for Wireless Network Synchronization -- Approximating Barrier Resilience in Wireless Sensor Networks -- Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks -- On Active Attacks on Sensor Network Key Distribution Schemes -- Key Levels and Securing Key Predistribution against Node Captures -- Revisiting DoS Attacks and Privacy in RFID-Enabled Networks -- Link Reversal: How to Play Better to Work Less -- Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks -- A Note on Uniform Power Connectivity in the SINR Model -- Locating a Black Hole without the Knowledge of Incoming Link -- Energy Efficient Alert in Single-Hop Networks of Extremely Weak Devices -- Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics -- Brief Announcement on MOGRIBA: Multi-Objective Geographical Routing for Biomedical Applications of WSN -- Routing on Delay Tolerant Sensor Networks -- Better Face Routing Protocols -- Building a Communication Bridge with Mobile Hubs -- Compressing Kinetic Data from Sensor Networks -- Relocation Analysis of Stabilizing MAC Algorithms for Large-Scale Mobile Ad Hoc Networks -- Deterministic Collision Free Communication Despite Continuous Motion -- Self-stabilizing Deterministic Gathering -- Gossiping in Jail -- Complexity and Approximation of a Geometric Local Robot Assignment Problem. |
| Record Nr. | UNISA-996465276803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic aspects of wireless sensor networks : 5th international workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009 ; revised selected papers / / Shlomi Dolev (ed.)
| Algorithmic aspects of wireless sensor networks : 5th international workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10-11, 2009 ; revised selected papers / / Shlomi Dolev (ed.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XI, 263 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) | DolevShlomi |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Wireless LANs Wireless sensor networks |
| ISBN | 3-642-05434-X |
| Classificazione |
DAT 250f
DAT 530f ELT 745f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Invited Talk I Actuator Nets: Folding, Reconfiguring and Deploying Sensors -- Invited Talk II The Power and Limitations of Simple Algorithms: A Partial Case Study of Greedy Mechanisim Design for Combinatorial Actions -- Sensor Field: A Computational Model -- Near-Optimal Radio Use for Wireless Network Synchronization -- Approximating Barrier Resilience in Wireless Sensor Networks -- Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks -- On Active Attacks on Sensor Network Key Distribution Schemes -- Key Levels and Securing Key Predistribution against Node Captures -- Revisiting DoS Attacks and Privacy in RFID-Enabled Networks -- Link Reversal: How to Play Better to Work Less -- Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks -- A Note on Uniform Power Connectivity in the SINR Model -- Locating a Black Hole without the Knowledge of Incoming Link -- Energy Efficient Alert in Single-Hop Networks of Extremely Weak Devices -- Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics -- Brief Announcement on MOGRIBA: Multi-Objective Geographical Routing for Biomedical Applications of WSN -- Routing on Delay Tolerant Sensor Networks -- Better Face Routing Protocols -- Building a Communication Bridge with Mobile Hubs -- Compressing Kinetic Data from Sensor Networks -- Relocation Analysis of Stabilizing MAC Algorithms for Large-Scale Mobile Ad Hoc Networks -- Deterministic Collision Free Communication Despite Continuous Motion -- Self-stabilizing Deterministic Gathering -- Gossiping in Jail -- Complexity and Approximation of a Geometric Local Robot Assignment Problem. |
| Altri titoli varianti | ALGOSENSORS 2009 |
| Record Nr. | UNINA-9910484875803321 |
| Berlin, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Game Theory [[electronic resource] ] : Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings / / edited by Marios Mavronicolas, Maria Papadoupoulou
| Algorithmic Game Theory [[electronic resource] ] : Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings / / edited by Marios Mavronicolas, Maria Papadoupoulou |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 359 p.) |
| Disciplina | 003.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer simulation
Application software Computers and civilization Electronic commerce Computer science Numerical analysis Computer Modelling Computer and Information Systems Applications Computers and Society e-Commerce and e-Business Models of Computation Numerical Analysis |
| ISBN | 3-642-04645-2 |
| Classificazione |
DAT 530f
MAT 920f SK 860 SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Monotonicity in Mechanism Design -- Computational Aspects of Equilibria -- A Modular Approach to Roberts’ Theorem -- Characterizing Incentive Compatibility for Convex Valuations -- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents -- Partition Equilibrium -- Better with Byzantine: Manipulation-Optimal Mechanisms -- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design -- Sequential Pivotal Mechanisms for Public Project Problems -- Characterizing the Existence of Potential Functions in Weighted Congestion Games -- Free-Riding and Free-Labor in Combinatorial Agency -- The Cost of Stability in Coalitional Games -- Non-clairvoyant Scheduling Games -- The Balloon Popping Problem Revisited: Lower and Upper Bounds -- Anarchy, Stability, and Utopia: Creating Better Matchings -- Equilibria in Dynamic Selfish Routing -- Stochastic Stability in Internet Router Congestion Games -- Nash Dynamics in Constant Player and Bounded Jump Congestion Games -- Price of Stability in Survivable Network Design -- Games with Congestion-Averse Utilities -- A New Derandomization of Auctions -- The Computational Complexity of Weak Saddles -- Learning and Approximating the Optimal Strategy to Commit To -- Doing Good with Spam Is Hard -- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems -- On the Complexity of Iterated Weak Dominance in Constant-Sum Games -- Swap Bribery -- Performances of One-Round Walks in Linear Congestion Games -- Nash Equilibria and the Price of Anarchy for Flows over Time -- Bayesian Auctions with Friends and Foes -- On Equilibria for ADM Minimization Games. |
| Record Nr. | UNISA-996465279503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic game theory : second international symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009 ; proceedings / / Marios Mavronicolas, Vicky G. Papadopoulou, eds
| Algorithmic game theory : second international symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009 ; proceedings / / Marios Mavronicolas, Vicky G. Papadopoulou, eds |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | New York, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XI, 359 p.) |
| Disciplina | 003.3 |
| Altri autori (Persone) |
MavronicolasMarios
PapadopoulouVicky G |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Game theory
Algorithms |
| ISBN | 3-642-04645-2 |
| Classificazione |
DAT 530f
MAT 920f SK 860 SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Monotonicity in Mechanism Design -- Computational Aspects of Equilibria -- A Modular Approach to Roberts’ Theorem -- Characterizing Incentive Compatibility for Convex Valuations -- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents -- Partition Equilibrium -- Better with Byzantine: Manipulation-Optimal Mechanisms -- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design -- Sequential Pivotal Mechanisms for Public Project Problems -- Characterizing the Existence of Potential Functions in Weighted Congestion Games -- Free-Riding and Free-Labor in Combinatorial Agency -- The Cost of Stability in Coalitional Games -- Non-clairvoyant Scheduling Games -- The Balloon Popping Problem Revisited: Lower and Upper Bounds -- Anarchy, Stability, and Utopia: Creating Better Matchings -- Equilibria in Dynamic Selfish Routing -- Stochastic Stability in Internet Router Congestion Games -- Nash Dynamics in Constant Player and Bounded Jump Congestion Games -- Price of Stability in Survivable Network Design -- Games with Congestion-Averse Utilities -- A New Derandomization of Auctions -- The Computational Complexity of Weak Saddles -- Learning and Approximating the Optimal Strategy to Commit To -- Doing Good with Spam Is Hard -- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems -- On the Complexity of Iterated Weak Dominance in Constant-Sum Games -- Swap Bribery -- Performances of One-Round Walks in Linear Congestion Games -- Nash Equilibria and the Price of Anarchy for Flows over Time -- Bayesian Auctions with Friends and Foes -- On Equilibria for ADM Minimization Games. |
| Record Nr. | UNINA-9910484630303321 |
| New York, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane
| Algorithms and Computation [[electronic resource] ] : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 362 p. 107 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Symbolic and Algebraic Manipulation Computer Graphics |
| Soggetto genere / forma |
Kongress2014.Chennai
Kongress2013.Kharagpur (West Bengal) Conference papers and proceedings. |
| ISBN | 3-319-04657-8 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational Geometry -- Algorithms and Approximations -- Distributed Computing and Networks.- Graph Algorithms -- Complexity and Bounds -- Graph Embeddings and Drawings. |
| Record Nr. | UNISA-996205183403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane
| Algorithms and Computation : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 362 p. 107 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Symbolic and Algebraic Manipulation Computer Graphics |
| Soggetto genere / forma |
Kongress2014.Chennai
Kongress2013.Kharagpur (West Bengal) Conference papers and proceedings. |
| ISBN | 3-319-04657-8 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational Geometry -- Algorithms and Approximations -- Distributed Computing and Networks.- Graph Algorithms -- Complexity and Bounds -- Graph Embeddings and Drawings. |
| Record Nr. | UNINA-9910483901203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra
| Algorithms and Computation [[electronic resource] ] : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XXIX, 1228 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Computer science—Mathematics Mathematics—Data processing Algorithms Discrete mathematics Data Science Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-38331-3
9786613561237 3-642-10631-5 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bubblesort and Juggling Sequences -- A Proof of the Molecular Conjecture -- Exact Algorithms for Dominating Clique Problems -- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming -- Exact Algorithms for the Bottleneck Steiner Tree Problem -- Exact Algorithms for Set Multicover and Multiset Multicover Problems -- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm -- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems -- On Protein Structure Alignment under Distance Constraint -- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability -- Max-Coloring Paths: Tight Bounds and Extensions -- Fréchet Distance Problems in Weighted Regions -- The Complexity of Solving Stochastic Games on Graphs -- Computational Complexity of Cast Puzzles -- New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body -- Reconstructing Numbers from Pairwise Function Values -- Hilbert’s Thirteenth Problem and Circuit Complexity -- Interval Stabbing Problems in Small Integer Ranges -- Online Sorted Range Reporting -- Data Structures for Approximate Orthogonal Range Counting -- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time -- Untangled Monotonic Chains and Adaptive Range Search -- Geodesic Spanners on Polyhedral Surfaces -- Approximating Points by a Piecewise Linear Function: I -- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers -- Computing the Map of Geometric Minimal Cuts -- On the Camera Placement Problem -- Graph Orientations with Set Connectivity Requirements -- A Linear Vertex Kernel for Maximum Internal Spanning Tree -- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem -- On Shortest Disjoint Paths in Planar Graphs -- An Optimal Labeling for Node Connectivity -- SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks -- 1-Bounded Space Algorithms for 2-Dimensional Bin Packing -- On the Advice Complexity of Online Problems -- Online Knapsack Problems with Limited Cuts -- Online Paging for Flash Memory Devices -- Shifting Strategy for Geometric Graphs without Geometry -- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics -- Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time -- Minimum Covering with Travel Cost -- Route-Enabling Graph Orientation Problems -- Complexity of Approximating the Vertex Centroid of a Polyhedron -- Popular Matchings with Variable Job Capacities -- On the Tightness of the Buhrman-Cleve-Wigderson Simulation -- Bounds on Contention Management Algorithms -- Algorithmic Folding Complexity -- Min-Energy Scheduling for Aligned Jobs in Accelerate Model -- Posi-modular Systems with Modulotone Requirements under Permutation Constraints -- Generalized Reduction to Compute Toric Ideals -- Linear and Sublinear Time Algorithms for Basis of Abelian Groups -- Good Programming in Transactional Memory -- Induced Packing of Odd Cycles in a Planar Graph -- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks -- Exploration of Periodically Varying Graphs -- Parameterized Complexity of Arc-Weighted Directed Steiner Problems -- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries -- Minimum Cycle Bases of Weighted Outerplanar Graphs -- Bandwidth on AT-Free Graphs -- Editing Graphs into Disjoint Unions of Dense Clusters -- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs -- Parameterizing Cut Sets in a Graph by the Number of Their Components -- Inapproximability of Maximal Strip Recovery -- The Complexity of Perfect Matching Problems on Dense Hypergraphs -- On Lower Bounds for Constant Width Arithmetic Circuits -- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria -- The Identity Correspondence Problem and Its Applications -- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs -- An Improved Approximation Algorithm for the Traveling Tournament Problem -- The Fault-Tolerant Facility Allocation Problem -- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks -- Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms -- The Directed Hausdorff Distance between Imprecise Point Sets -- Computing Multidimensional Persistence -- Locating an Obnoxious Line among Planar Objects -- Finding Fullerene Patches in Polynomial Time -- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids -- A Self-stabilizing and Local Delaunay Graph Construction -- Succinct Greedy Geometric Routing in the Euclidean Plane -- Electric Routing and Concurrent Flow Cutting -- A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths -- Strong Robustness of Randomized Rumor Spreading Protocols -- Data Structures for Range Median Queries -- Deletion without Rebalancing in Multiway Search Trees -- Counting in the Presence of Memory Faults -- A Simple, Fast, and Compact Static Dictionary -- Reconstructing Polygons from Scanner Data -- Computing Large Matchings in Planar Graphs with Fixed Minimum Degree -- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs -- Covering a Graph with a Constrained Forest (Extended Abstract) -- Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs -- Upward Star-Shaped Polyhedral Graphs -- Conditional Hardness of Approximating Satisfiable Max 3CSP-q -- The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) -- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement -- Step-Assembly with a Constant Number of Tile Types -- Lower Bounds on Fast Searching -- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity -- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time -- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k -- Optimal Randomized Algorithm for the Density Selection Problem -- New Results on Simple Stochastic Games -- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences -- Succinct Index for Dynamic Dictionary Matching -- Range Non-overlapping Indexing -- Querying Two Boundary Points for Shortest Paths in a Polygonal Domain -- Pattern Matching for 321-Avoiding Permutations -- Folding a Better Checkerboard -- Finding All Approximate Gapped Palindromes -- General Pseudo-random Generators from Weaker Models of Computation -- Random Generation and Enumeration of Bipartite Permutation Graphs -- A Combinatorial Algorithm for Horn Programs -- Online Maximum Directed Cut -- Maintaining Nets and Net Trees under Incremental Motion -- Distributed Scheduling of Parallel Hybrid Computations -- I/O-Efficient Contour Tree Simplification -- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes -- I/O and Space-Efficient Path Traversal in Planar Graphs -- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model -- Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) -- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets -- On Partitioning a Graph into Two Connected Subgraphs. |
| Record Nr. | UNISA-996465913603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applications of Evolutionary Computing [[electronic resource] ] : EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG,Tübingen, Germany, April 15-17, 2009, Proceedings / / edited by Mario Giacobini, Anthony Brabazon, Stefano Cagnoni, Aniko Ekart, Anna I. Esparcia-Alcázar, Muddassar Farooq, Andreas Fink, Penousal Machado, Jon McCormack, Michael O'Neill, Ferrante Neri, Mike Preuss, Franz Rothlauf, Ernesto Tarantino, Shengxiang Yang
| Applications of Evolutionary Computing [[electronic resource] ] : EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG,Tübingen, Germany, April 15-17, 2009, Proceedings / / edited by Mario Giacobini, Anthony Brabazon, Stefano Cagnoni, Aniko Ekart, Anna I. Esparcia-Alcázar, Muddassar Farooq, Andreas Fink, Penousal Machado, Jon McCormack, Michael O'Neill, Ferrante Neri, Mike Preuss, Franz Rothlauf, Ernesto Tarantino, Shengxiang Yang |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XXX, 831 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Computer science Computers Computer science—Mathematics Programming Techniques Computer Communication Networks Theory of Computation Computer Hardware Mathematical Applications in Computer Science |
| ISBN | 3-642-01129-2 |
| Classificazione |
DAT 510f
DAT 530f DAT 718f MAT 919f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | EvoCOMNET Contributions -- EvoENVIRONMENT Contributions -- EvoFIN Contributions -- EvoGAMES Contributions -- EvoHOT Contributions -- EvoIASP Contributions -- EvoINTERACTION Contributions -- EvoMUSART Contributions -- EvoNUM Contributions -- EvoSTOC Contributions -- EvoTRANSLOG Contributions. |
| Record Nr. | UNISA-996466021203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applications of evolutionary computing : EvoWorkshops 2009 : EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG, Tubingen, Germany, April 15-17, 2009 ; proceedings / / Mario Giacobini ... [et al.] (eds.)
| Applications of evolutionary computing : EvoWorkshops 2009 : EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG, Tubingen, Germany, April 15-17, 2009 ; proceedings / / Mario Giacobini ... [et al.] (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | [Berlin], : Springer, 2009 |
| Descrizione fisica | 1 online resource (XXX, 831 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) | GiacobiniMario |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Evolutionary computation
Evolutionary programming (Computer science) |
| ISBN | 3-642-01129-2 |
| Classificazione |
DAT 510f
DAT 530f DAT 718f MAT 919f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | EvoCOMNET Contributions -- EvoENVIRONMENT Contributions -- EvoFIN Contributions -- EvoGAMES Contributions -- EvoHOT Contributions -- EvoIASP Contributions -- EvoINTERACTION Contributions -- EvoMUSART Contributions -- EvoNUM Contributions -- EvoSTOC Contributions -- EvoTRANSLOG Contributions. |
| Record Nr. | UNINA-9910483868403321 |
| [Berlin], : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and oline agorithms : 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, revised papers / / Evripidis Bampis, Martin Skutella, editors
| Approximation and oline agorithms : 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, revised papers / / Evripidis Bampis, Martin Skutella, editors |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (X, 293 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
SkutellaMartin
BampisEvripidis |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Approximation theory
Algorithms |
| ISBN | 3-540-93980-6 |
| Classificazione |
DAT 530f
MAT 410f MAT 652f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | WAOA 2008 -- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees -- Size Versus Stability in the Marriage Problem -- Degree-Constrained Subgraph Problems: Hardness and Approximation Results -- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines -- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs -- Minimizing Average Flow Time on Unrelated Machines -- Cooperation in Multiorganization Matching -- Randomized Algorithms for Buffer Management with 2-Bounded Delay -- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints -- Malicious Bayesian Congestion Games -- Stackelberg Strategies and Collusion in Network Games with Splittable Flow -- Peak Shaving through Resource Buffering -- On Lagrangian Relaxation and Subset Selection Problems -- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements -- Caching Content under Digital Rights Management -- Reoptimization of Weighted Graph and Covering Problems -- Smoothing Imprecise 1.5D Terrains -- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs -- Dynamic Offline Conflict-Free Coloring for Unit Disks -- Experimental Analysis of Scheduling Algorithms for Aggregated Links -- A Approximation Algorithm for the Minimum Maximal Matching Problem -- On the Maximum Edge Coloring Problem. |
| Record Nr. | UNINA-9910484454403321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
