0
Your cart

Your cart is empty

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

Showing 1 - 4 of 4 matches in All Departments

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques - 7th International Workshop on... Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques - 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA August 22-24, 2004 , Proceedings (Paperback, 2004 ed.)
Klaus Jansen, Sanjeev Khanna, Jose D.P. Rolim, Dana Ron
R1,751 Discovery Miles 17 510 Ships in 10 - 15 working days

Thisvolumecontainsthepaperspresentedatthe7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2004) and the 8th International Workshop on Randomization and Compu- tion (RANDOM 2004), which took place concurrently at Harvard University, Cambridge, on August 22-24, 2004. APPROX focuses on algorithmic and c- plexity issues surrounding the development of e?cient approximate solutions to computationally hard problems, and this year's workshop was the seventh in the series after Aalborg (1998), Berkeley (1999), Saarbru ]cken (2000), Berkeley (2001), Rome (2002), and Princeton (2003). RANDOM is concerned with app- cations of randomness to computational and combinatorial problems, and this year'sworkshopwasthe eighth in the seriesfollowing Bologna(1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), and Princeton (2003). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, inapproximability results, approximationclasses, - line problems, small space and data streaming algorithms, sub-linear time al- rithms, embeddings and metric space methods in approximation, math prog- ming in approximation algorithms, coloring and partitioning, cuts and conn- tivity, geometric problems, network design and routing, packing and covering, scheduling, game theory, design and analysis of randomized algorithms, r- domized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projectionsand - beddings, error-correctingcodes, average-caseanalysis, propertytesting, com- tational learning theory, and other applications of approximation and rand- ness. The volumecontains19+18contributed papers, selected by the two program committees from 54+33 submissions received in response to the call for papers."

An Engineering Companion to the Mechanics of Materials - A Systems Approach (Paperback): Christopher Jenkins, Sanjeev Khanna An Engineering Companion to the Mechanics of Materials - A Systems Approach (Paperback)
Christopher Jenkins, Sanjeev Khanna
R1,950 R1,482 Discovery Miles 14 820 Save R468 (24%) Ships in 10 - 15 working days

An Engineering Companion to Mechanics of Materials is the first volume in the Momentum Press collection The Modern Engineering Companions: A Systems Approach to the Study of Engineering. In Mechanics of Materials, we apply the intuitive "systems approach" to learning, the advantages of which are several. The student first gets a broad overview of the entire subject rather than the narrow piecemeal vision afforded by the traditional "component approach" common to most engineering texts. Mechanics of Materials comes with additional features to improve student learning, including Common Confusing Concepts (C3) noted and clarii ed, indication of key concepts, side bar discussions, worked examples, and exercises for developing engineering intuition. The Companions are intended as a supplementary resource to help both undergraduate, graduate, and post-graduate students better learn and understand engineering concepts.

Mechanics of Materials - A Modern Integration of Mechanics and Materials in Structural Design (Hardcover): Christopher Jenkins,... Mechanics of Materials - A Modern Integration of Mechanics and Materials in Structural Design (Hardcover)
Christopher Jenkins, Sanjeev Khanna
R3,714 Discovery Miles 37 140 Ships in 10 - 15 working days

This new book is the first to bridge the often disparate bodies of knowledge now known as applied mechanics and materials science. Using a very methodological process to introduce mechanics, materials, and design issues in a manner called "total structural design," this book seeks a solution in "total design space" Features of the text include:
* A generalized design template for solving structural design problems.
* Every chapter first introduces mechanics concepts through deformation, equilibrium, and energy considerations. Then the constitutive nature of the chapter topic is presented, followed by a link between mechanics and materials concepts. Details of analysis and materials selection are subsequently discussed.
* A concluding example design problem is provided in most chapters, so that students may get a sense of how mechanics and materials come together in the design of a real structure.
* Exercises are provided that are germane to aerospace, civil, and mechanical engineering applications, and include both deterministic and design-type problems.
* Accompanying website contains a wealth of information complementary to this text, including a set of virtual labs. Separate site areas are available for the instructor and students.
*Combines theories of solid mechanics, materials science and structural design in one coherent text/reference
*Covers physical scales from the atomistic to continuum mechanics
*Offers a generalized structural design template

Complexity Classifications of Boolean Constraint Satisfaction Problems (Hardcover): Nadia Creignou, Sanjeev Khanna, Madhu Sudan Complexity Classifications of Boolean Constraint Satisfaction Problems (Hardcover)
Nadia Creignou, Sanjeev Khanna, Madhu Sudan; Series edited by Peter Hammer
R2,541 Discovery Miles 25 410 Ships in 12 - 17 working days

Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating "global" inferences about the nature of computation.

This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rule-based approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable. It also provides a complete classification of all problems that arise in restricted versions of central complexity classes such as NP, NPO, NC, PSPACE, and #P.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Marvel Spiderman Fibre-Tip Markers (Pack…
R57 Discovery Miles 570
Bostik Sew Simple (25ml)
R31 Discovery Miles 310
Bestway Beach Ball (51cm)
 (2)
R26 Discovery Miles 260
JBL T500 On-Ear Headphone (Black)
Other audio format R599 R545 Discovery Miles 5 450
Philips TAUE101 Wired In-Ear Headphones…
R124 Discovery Miles 1 240
How To Fix (Unf*ck) A Country - 6 Things…
Roy Havemann Paperback R310 R210 Discovery Miles 2 100
Clean Clean Rain Reserve Blend Eau De…
R2,469 Discovery Miles 24 690
Jabra Elite 5 Hybrid ANC True Wireless…
R2,899 R2,399 Discovery Miles 23 990
Not available
Vibro Shape Belt
R1,099 R726 Discovery Miles 7 260

 

Partners