You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Matrix-analytic and related methods have become recognized as an important and fundamental approach for the mathematical analysis of general classes of complex stochastic models. Research in the area of matrix-analytic and related methods seeks to discover underlying probabilistic structures intrinsic in such stochastic models, develop numerical algorithms for computing functionals (e.g., performance measures) of the underlying stochastic processes, and apply these probabilistic structures and/or computational algorithms within a wide variety of fields. This volume presents recent research results on: the theory, algorithms and methodologies concerning matrix-analytic and related methods in ...
Matrix-analytic methods are fundamental to the analysis of a family of Markov processes rich in structure and of wide applicability. They are extensively used in the modelling and performance analysis of computer systems, telecommunication networks, network protocols and many other stochastic systems of current commercial and engineering interest. This volume deals with: (1) various aspects of the theory of block-structured Markov chains; (2) analysis of complex queueing models; and (3) parameter estimation and specific applications to such areas as cellular mobile systems, FS-ALOHA, the Internet and production systems.
This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.
This book constitutes the thoroughly refereed conference proceedings of the 9th International Conference on Web and Internet Economics, WINE 2013, held in Cambridge, MA, USA, in December 2013. The 36 revised full papers were carefully reviewed and selected from 150 submissions and cover research in theoretical computer science, artificial intelligence and microeconomics.
Analysis and Modeling of Manufacturing Systems is a set of papers on some of the newest research and applications of mathematical and computational techniques to manufacturing systems and supply chains. These papers deal with fundamental questions (how to predict factory performance: how to operate production systems) and explicitly treat the stochastic nature of failures, operation times, demand, and other important events. Analysis and Modeling of Manufacturing Systems will be of interest to readers with a strong background in operations research, including researchers and mathematically sophisticated practitioners.
This is the first of three volumes containing edited versions of papers and commentaries presented at invited symposium sessions of the Tenth World Congress of the Econometric Society, held in Shanghai in August 2010. The papers summarize and interpret key developments in economics and econometrics and they discuss future directions for a wide variety of topics, covering both theory and application. Written by the leading specialists in their fields, these volumes provide a unique, accessible survey of progress on the discipline. The first volume primarily addresses economic theory, with specific focuses on nonstandard markets, contracts, decision theory, communication and organizations, epistemics and calibration, and patents.
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.
We use numbers here, there and everywhere -- Numbers are some of my favorite things -- Linking numbers : operations on numbers -- Words and numbers : being careful -- Writing really big and really small numbers, and those in-between -- Touching all bases, at times with logs -- Numbers need to be exact, but it ain't necessarily so -- The different types of numbers have not evolved, but our understanding of them has -- Really, really big and really, really small numbers -- The whole truth of whole numbers -- The math of the digital world : modular arithmetic (or using number leftovers) -- The math of what will be : progressions of growth and decay -- Untangling the worlds of probability and statistics -- The math of what might be : probability - what are the odds? -- The math of what was : statistics - the good, the bad, and the evil -- The math of big data -- The math of optimization, ranking, voting, and allocation -- The math of gaming -- The math of risk.
This book constitutes the refereed proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2004, held in New York City, USA in June 2004. The 32 revised papers presented were carefully reviewed and selected from 109 submissions. Among the topics addressed are vehicle routing, network management, mixed-integer programming, computational complexity, game theory, supply chain management, stochastic optimization problems, production scheduling, graph computations, computational graph theory, separation algorithms, local search, linear optimization, integer programming, graph coloring, packing, combinatorial optimization, routing, flow algorithms, 0/1 polytopes, and polyhedra.
This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.