0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (3)
  • -
Status
Brand

Showing 1 - 3 of 3 matches in All Departments

Theory and Applications of Models of Computation - 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013.... Theory and Applications of Models of Computation - 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings (Paperback, 2013 ed.)
T-H. Hubert Chan, Lap-Chi Lau, Luca Trevisan
R1,492 Discovery Miles 14 920 Ships in 10 - 15 working days

This book constitutes the refereed proceedings of the 10th International Conference on Theory and Applications of Models of Computation, TAMC 2013, held in Hong Kong, China, in May 2013. The 31 revised full papers presented were carefully reviewed and selected from 70 submissions. Bringing together a wide range of researchers with interests in computational theory and applications, the papers address the three main themes of the conference which were computability, complexity, and algorithms and present current research in these fields with aspects to theoretical computer science, algorithmic mathematics, and applications to the physical sciences.

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques - 8th International Workshop on... Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques - 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings (Paperback, 2005 ed.)
Chandra Chekuri, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
R1,688 Discovery Miles 16 880 Ships in 10 - 15 working days

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 submis

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on... Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 (Paperback, 2001 ed.)
Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
R1,570 Discovery Miles 15 700 Ships in 10 - 15 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Lucky Plastic 3-in-1 Nose Ear Trimmer…
R289 Discovery Miles 2 890
Minions 2 - The Rise Of Gru
DVD R133 Discovery Miles 1 330
Baby Dove Rich Moisture Wipes (50Wipes)
R40 Discovery Miles 400
Loot
Nadine Gordimer Paperback  (2)
R383 R310 Discovery Miles 3 100
Aerolatte Cappuccino Art Stencils (Set…
R110 R95 Discovery Miles 950
Baby Dove Shampoo Rich Moisture 200ml
R50 Discovery Miles 500
Skipping-Rope (230cm)
R130 Discovery Miles 1 300
Joseph Joseph Index Mini (Graphite)
R642 Discovery Miles 6 420
Mission Impossible 6: Fallout
Tom Cruise, Henry Cavill, … Blu-ray disc  (1)
R131 R91 Discovery Miles 910
Baby Dove Body Wash 200ml
R50 Discovery Miles 500

 

Partners