Sanjeev Khanna – författare
Visar alla böcker från författaren Sanjeev Khanna. Handla med fri frakt och snabb leverans.
6 produkter
6 produkter
E-bok
PDF, Engelska, 20051 220 kr
Läs direkt efter köp
This 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 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
Inbunden, Engelska, 2001
1 040 kr
Skickas inom 5-8 vardagar
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.
566 kr
Skickas inom 10-15 vardagar
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.
687 kr
Läs direkt efter köp
644 kr
Skickas inom 5-8 vardagar
Inbunden, Engelska, 2024
5 750 kr
Skickas inom 5-8 vardagar