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.
Algorithms and Data Structures [[electronic resource] ] : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / / edited by Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack
| Algorithms and Data Structures [[electronic resource] ] : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / / edited by Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 538 p. 132 illus.) |
| Disciplina | 005.73 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks |
| ISBN | 3-642-40104-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and data structures in bioinformatics -- Algorithms and data structures in combinatorics -- Algorithms and data structures in computational geometry -- Algorithms and data structures in databases -- Algorithms and data structures in graphics -- Parallel and distributed computing. |
| Record Nr. | UNISA-996466025003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / / edited by Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack
| Algorithms and Data Structures [[electronic resource] ] : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / / edited by Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 538 p. 132 illus.) |
| Disciplina | 005.73 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks |
| ISBN | 3-642-40104-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and data structures in bioinformatics -- Algorithms and data structures in combinatorics -- Algorithms and data structures in computational geometry -- Algorithms and data structures in databases -- Algorithms and data structures in graphics -- Parallel and distributed computing. |
| Record Nr. | UNINA-9910483920903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
| Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 329 p. 42 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Computer Graphics |
| ISBN | 3-319-89441-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications. |
| Record Nr. | UNISA-996466231403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
| Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 329 p. 42 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Computer Graphics |
| ISBN | 3-319-89441-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications. |
| Record Nr. | UNINA-9910349424403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers / / edited by Roberto Solis-Oba, Giuseppe Persiano
| Approximation and Online Algorithms [[electronic resource] ] : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers / / edited by Roberto Solis-Oba, Giuseppe Persiano |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (X, 278 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Application software Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer and Information Systems Applications |
| ISBN | 3-642-29116-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastiâan Marbâan, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourváes, Jâerãome Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomâaés Ebenlendr and Jiérâi Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek.
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro Lâopez-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth St²lting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosâen -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourváes and Jâerãome Monnot -- Generalized Maximum Flows over Time / Martin GroÇ and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz. |
| Record Nr. | UNISA-996466000103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers / / edited by Klaus Jansen, Roberto Solis-Oba
| Approximation and Online Algorithms [[electronic resource] ] : 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers / / edited by Klaus Jansen, Roberto Solis-Oba |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 273 p. 18 illus., 3 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Application software Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer and Information Systems Applications |
| ISBN | 3-642-18318-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466063703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / / edited by Giuseppe Persiano, Roberto Solis-Oba
| Approximation and Online Algorithms [[electronic resource] ] : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / / edited by Giuseppe Persiano, Roberto Solis-Oba |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 295 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed Multicuts -- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria -- Approximation Algorithms for Spreading Points -- More Powerful and Simpler Cost-Sharing Methods -- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints -- Priority Algorithms for Graph Optimization Problems -- Pricing Network Edges to Cross a River -- Submodular Integer Cover and Its Application to Production Planning -- Stochastic Online Scheduling on Parallel Machines -- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path -- Order-Preserving Transformations and Greedy-Like Algorithms -- Off-line Admission Control for Advance Reservations in Star Networks -- Joint Base Station Scheduling -- Universal Bufferless Routing -- Strong Colorings of Hypergraphs -- Deterministic Monotone Algorithms for Scheduling on Related Machines -- Better Bounds for Minimizing SONET ADMs. |
| Record Nr. | UNISA-996465950503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / / edited by Giuseppe Persiano, Roberto Solis-Oba
| Approximation and Online Algorithms [[electronic resource] ] : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers / / edited by Giuseppe Persiano, Roberto Solis-Oba |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 295 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence - Data processing Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed Multicuts -- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria -- Approximation Algorithms for Spreading Points -- More Powerful and Simpler Cost-Sharing Methods -- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints -- Priority Algorithms for Graph Optimization Problems -- Pricing Network Edges to Cross a River -- Submodular Integer Cover and Its Application to Production Planning -- Stochastic Online Scheduling on Parallel Machines -- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path -- Order-Preserving Transformations and Greedy-Like Algorithms -- Off-line Admission Control for Advance Reservations in Star Networks -- Joint Base Station Scheduling -- Universal Bufferless Routing -- Strong Colorings of Hypergraphs -- Deterministic Monotone Algorithms for Scheduling on Related Machines -- Better Bounds for Minimizing SONET ADMs. |
| Record Nr. | UNINA-9910767548803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers / / edited by Klaus Jansen, Roberto Solis-Oba
| Approximation and Online Algorithms [[electronic resource] ] : First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers / / edited by Klaus Jansen, Roberto Solis-Oba |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (VIII, 268 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Algorithms Data structures (Computer science) Numerical analysis Computer science—Mathematics Computer graphics Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Data Structures Numeric Computing Discrete Mathematics in Computer Science Computer Graphics |
| ISBN |
1-280-30697-1
9786610306978 3-540-24592-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks -- Online Coloring of Intervals with Bandwidth -- Open Block Scheduling in Optical Communication Networks -- Randomized Priority Algorithms -- Tradeoffs in Worst-Case Equilibria -- Load Balancing of Temporary Tasks in the ? p Norm -- Simple On-Line Algorithms for Call Control in Cellular Networks -- Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees -- A -Approximation Algorithm for Scheduling Identical Malleable Tasks -- Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation -- Scheduling AND/OR-Networks on Identical Parallel Machines -- Combinatorial Interpretations of Dual Fitting and Primal Fitting -- On the Approximability of the Minimum Fundamental Cycle Basis Problem -- The Pledge Algorithm Reconsidered under Errors in Sensors and Motion -- The Online Matching Problem on a Line -- How to Whack Moles -- Online Deadline Scheduling: Team Adversary and Restart -- Minimum Sum Multicoloring on the Edges of Trees -- Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms -- On-Line Extensible Bin Packing with Unequal Bin Sizes -- ARACNE Talks -- Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms -- Power Consumption Problems in Ad-Hoc Wireless Networks -- A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem -- Disk Graphs: A Short Survey -- Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems. |
| Record Nr. | UNINA-9910144207003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers / / edited by Klaus Jansen, Roberto Solis-Oba
| Approximation and Online Algorithms [[electronic resource] ] : First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers / / edited by Klaus Jansen, Roberto Solis-Oba |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (VIII, 268 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Algorithms Data structures (Computer science) Numerical analysis Computer science—Mathematics Computer graphics Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Data Structures Numeric Computing Discrete Mathematics in Computer Science Computer Graphics |
| ISBN |
1-280-30697-1
9786610306978 3-540-24592-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks -- Online Coloring of Intervals with Bandwidth -- Open Block Scheduling in Optical Communication Networks -- Randomized Priority Algorithms -- Tradeoffs in Worst-Case Equilibria -- Load Balancing of Temporary Tasks in the ? p Norm -- Simple On-Line Algorithms for Call Control in Cellular Networks -- Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees -- A -Approximation Algorithm for Scheduling Identical Malleable Tasks -- Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation -- Scheduling AND/OR-Networks on Identical Parallel Machines -- Combinatorial Interpretations of Dual Fitting and Primal Fitting -- On the Approximability of the Minimum Fundamental Cycle Basis Problem -- The Pledge Algorithm Reconsidered under Errors in Sensors and Motion -- The Online Matching Problem on a Line -- How to Whack Moles -- Online Deadline Scheduling: Team Adversary and Restart -- Minimum Sum Multicoloring on the Edges of Trees -- Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms -- On-Line Extensible Bin Packing with Unequal Bin Sizes -- ARACNE Talks -- Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms -- Power Consumption Problems in Ad-Hoc Wireless Networks -- A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem -- Disk Graphs: A Short Survey -- Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems. |
| Record Nr. | UNISA-996465433003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||