الصفحة 1
الصفحة 1
Internet and network economics ; 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings
This book constitutes the refereed proceedings of the 4th International Workshop on Internet and Network Economics, WINE 2008, held in Shanghai, China, in December 2008.The 68 revised full papers presented together with 10 invited talks were carefully reviewed and selected from 126 submissions. The papers are organized in topical sections on market equilibrium, congestion games, information markets, nash equilibrium, network games, solution concepts, algorithms and optimization, mechanism design, equilibrium, online advertisement, sponsored search auctions, and voting problems.
Frontiers in Computing Technologies for Manufacturing Applications
Frontiers in Computing Technologies for Manufacturing Applications presents an overview of the state-of-the-art intelligent computing in manufacturing. Modeling, data processing, algorithms and computational analysis of difficult problems found in advanced manufacturing are discussed. It is the first book to bring together combinatorial optimization, information systems and fault diagnosis and monitoring in a consistent manner. Techniques are presented in order to aid decision makers needing to consider multiple, conflicting objectives in their decision processes. In particular, the use of metaheuristic optimization techniques for multi-objective problems is discussed. Readers will learn about computational technologies that can improve the performance of manufacturing systems ranging from manufacturing equipment to supply chains.
Combinatorial pattern matching ; 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
This book presented original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, sufix arrays and trees, and computational biology. Combinatorial Pattern Matching addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays.The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed eficiently.
