Page 1
Page 1
img

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; Vol.3990 ; 3rd International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings

Constitutes the refereed proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2006. The 20 revised full papers presented together with 3 invited talks address methodological and foundational issues from AI, OR, and algorithmics and present applications to the solution of combinatorial optimization problems in various fields via constraint programming.

img

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; Vol.3524 : 2nd International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005

Intended primarily as a forum to focus on the integration and hybridization of the approaches of constraint programming (CP), arti?cial intelligence (AI), and operations research (OR) technologies for solving large-scale and complex real-life optimization problems. Therefore, CPAIOR is never far from industrial applications. The high number of submissions received this year, almost 100 papers, in witness to the interest of the research community in this conference. From these submissions, we chose 26 to be published in full in the proceedings. This volume includes summaries of the invited talks of CPAIOR: one from industry, one from the embedded system research community, and one from the operations research community.

img

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; 5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings

The 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008) was held in Paris, France May 20–23, 2008. The purpose of this conference series is to bring together researchers in the felds of constraint programming, artifcial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the felds’ diferent techniques. Through the years, this research community is discovering that the felds have much in c- mon, and there has been tremendous richness in the resulting cross-fertilization of felds.

img

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings

This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007.

img

Hybrid metaheuristics ; Vol. 4030 ; 3rd International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings

The selection of papers for HM 2006 consolidated some of the mainstream issues that have emerged from the past editions. Firstly, there are prominent examples of e?ective hybrid techniques whose design and implementation were motivated by challenging real-world applications. We believe this is particularly important for two reasons: on the one hand, researchers are conscious that the primary goal of developing algorithms is to solve relevant real-life problems; on the other hand, the path towarde?cient solving methods for practical problems is a source of new outstanding ideas and theories. A second important issue is that the research community on metaheur- tics has become increasingly interested in and open to techniques and methods known from arti?cial intelligence (AI) and operations research (OR). So far, the most representative examples of such integration have been the use of AI/OR techniques as subordinates of metaheuristic methods. As a historical and - ymological note, this is in perfect accordance with the original meaning of a metaheuristic as a “general strategy controlling a subordinate heuristic. ” The awareness of the need for a sound experimental methodology is a third keypoint.

img

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics ; International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings

Stochastic local search (SLS) algorithms enjoy great popularity as powerful and versatile tools for tackling computationally hard decision and optimization pr- lems from many areas of computer science, operations research, and engineering. However, in recent years it has become evident that at the core of this development task there is a highly complex engineering process, which combines various aspects of algorithm design with empirical analysis techniques and problem-specific background, and which relies heavily on knowledge from a number of disciplines and areas, including computer science, operations research, artificial intelligence, and statistics. This development process needs to be - sisted by a sound methodology that addresses the issues arising in the various phases of algorithm design, implementation, tuning, and experimental eval- tion.

img

Concurrency Theory : Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

Concurrency Theory is a synthesis of one of the major threads of theoretical computer science research focusing on languages and graphical notations for describing collections of simultaneously evolving components that interact through synchronous communication. The main specification notation focused on in this book is LOTOS. An extensive introduction to this particular process calculus is given, highlighting how the approach differs from competitor techniques, such as CCS and CSP.

img

Boundary value problems, Weyl Functions, and differential operators

This book presents a comprehensive survey of modern operator techniques for boundary value problems and spectral theory, employing abstract boundary mappings and Weyl functions.

Results Per Page