José D.P. Rolim – författare
Visar alla böcker från författaren José D.P. Rolim. Handla med fri frakt och snabb leverans.
14 produkter
14 produkter
538 kr
Skickas inom 10-15 vardagar
This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation(RANDOM2005),whichtookplaceconcurrentlyattheUniversity of California in Berkeley, on August 22-24, 2005. APPROX focuses on algori- mic and complexity issues surrounding the development of e?cient approximate solutions to computationally hard problems, and APPROX 2005 was the eighth in the series after Aalborg (1998), Berkeley (1999), Saarbru ..cken (2000), Ber- ley (2001),Rome (2002),Princeton(2003),and Cambridge(2004).RANDOM is concerned with applications of randomness to computational and combinatorial problems, and RANDOM 2005 was the ninth workshop in the series foll- ing Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), and Cambridge (2004).Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting,packingand covering,scheduling,designandanalysisofr- domized algorithms, randomized complexity theory, pseudorandomness and - randomization,random combinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, r- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of - proximation and randomness. The volume contains 20 contributed papers selected by the APPROX P- gram Committee out of 50 submissions, and 21 contributed papers selected by the RANDOM Program Committee out of 51 submissions.
554 kr
Skickas inom 10-15 vardagar
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, embeddings and metric space methods, and more.
538 kr
Skickas inom 10-15 vardagar
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.
538 kr
Skickas inom 10-15 vardagar
This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
Randomization and Approximation Techniques in Computer Science
6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings
Häftad, Engelska, 2002
554 kr
Skickas inom 10-15 vardagar
This volume contains the papers presented at the 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RAN- DOM 2002), which took place at Harvard University, Cambridge, Massachusetts, from September 13-15, 2002. RANDOM 2002 was concerned with applications of randomness to computational and combinatorial problems, and was the sixth workshop in the series following Bologna, Barcelona, Berkeley, Geneva, and B- keley again. The volume contains 21 contributed papers, selected by the program c- mittee from 48 submissions received in response to the call for papers. We thank all of the authors who submitted papers, our invited speakers, the members of the program committee: Dimitris Achlioptas, Microsoft Research Martin Dyer, U. of Leeds Uriel Feige, Weizmann Institute Russell Impagliazzo, UC San Diego Sampath Kannan, U. of Pennsylvania David Karger, MIT Nati Linial, Hebrew U. Rafail Ostrovsky, Telcordia Technologies Paul Spirakis, U. of Patras and CTI Angelika Steger, TU Munich R..udiger Urbanke, Swiss Federal Inst. of Tech. Salil Vadhan, Harvard U., chair, and the external reviewers: N. Alon, R. Alur, A. Ambainis, T. Batu, J. Feig- baum, S.Gerke, Y. Gertner, A. Goerdt, L. Goldberg, J. Hastad, C. Iliopoulos, Y. Ishai, V. Kabanets, S. Khot, L. Kirousis, S. Kontogiannis, M. Krivelevich, M. Mavronicolas, A. McGregor, F. McSherry, D. van Melkebeek, M. Molloy, E. Mossel, S. Nikoletseas, R. Raz, D. Ron, P. Tetali, L. Trevisan, E. Vigoda, J. Watrous, and P. Winkler.
538 kr
Skickas inom 10-15 vardagar
This volume contains the papers presented at the3rd International Wo- shoponRandomizationandApproximationTechniquesinComputer Science (RANDOM'99) and the 2nd International Workshop on - proximation Algorithms for Combinatorial Optimization Problems (APPROX'99), which took place concurrently at the University of California, Berkeley, from August 8-11, 1999. RANDOM'99 is concerned with appli- tions of randomness to computational and combinatorial problems, and is the third workshop in the series following Bologna (1997) and Barcelona (1998). APPROX'99 focuses on algorithmic and complexity issues surrounding the - velopment of e?cient approximate solutions to computationally hard problems, and is the second in the series after Aalborg (1998). The volume contains 24 contributed papers, selected by the two program committees from 44 submissions received in response to the call for papers, together with abstracts of invited lectures by Uri Feige (Weizmann Institute), Christos Papadimitriou (UC Berkeley), Madhu Sudan (MIT), and Avi Wigd- son (Hebrew University and IAS Princeton).We would like to thank all of the authors who submitted papers, our invited speakers, the external referees we consulted and the members of the program committees, who were: RANDOM'99 APPROX'99 Alistair Sinclair, UC Berkeley Dorit Hochbaum, UC Berkeley Noga Alon, Tel Aviv U. Sanjeev Arora, Princeton U. Jennifer Chayes, Microsoft Leslie Hall, Johns Hopkins U. Monika Henzinger, Compaq-SRC Samir Khuller, U. of Maryland Mark Jerrum, U. of Edinburgh Phil Klein, Brown U.
Automata, Languages and Programming
27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings
Häftad, Engelska, 2000
1 101 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the state-of-the-art in theoretical computer science.
Algorithmic Aspects of Wireless Sensor Networks
Second International Workshop, ALGOSENSORS 2006, Venice, Italy, July 15, 2006, Revised Selected Papers
Häftad, Engelska, 2006
554 kr
Skickas inom 10-15 vardagar
This book constitutes the reviewed proceedings of the Second International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2006, held in Venice, Italy in July 2006, in association with ICALP 2006. Topics addressed are foundational and algorithmic aspects of the wireless sensor networks research. In particular, ALGOSENSORS focuses on abstract models, complexity-theoretic results and lower-bounds.
1 101 kr
Skickas inom 10-15 vardagar
This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.
1 069 kr
Skickas inom 10-15 vardagar
Wireless ad hoc sensor networks has recently become a very active research subject. Achieving efficient, fault-tolerant realizations of very large, highly dynamic, complex, unconventional networks is a real challenge for abstract modelling, algorithmic design and analysis, but a solid foundational and theoretical background seems to be lacking. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks. The intended audience includes researchers and graduate students working on sensor networks, and the broader areas of wireless networking and distributed computing, as well as practitioners in the relevant application areas. The book can also serve as a text for advanced courses and seminars.
554 kr
Skickas inom 10-15 vardagar
This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
538 kr
Skickas inom 10-15 vardagar
This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
538 kr
Skickas inom 10-15 vardagar
This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.
1 069 kr
Skickas inom 10-15 vardagar
Wireless ad hoc sensor networks has recently become a very active research subject. Achieving efficient, fault-tolerant realizations of very large, highly dynamic, complex, unconventional networks is a real challenge for abstract modelling, algorithmic design and analysis, but a solid foundational and theoretical background seems to be lacking. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks. The intended audience includes researchers and graduate students working on sensor networks, and the broader areas of wireless networking and distributed computing, as well as practitioners in the relevant application areas. The book can also serve as a text for advanced courses and seminars.