Sciweavers

566 search results - page 78 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
114
Voted
ECP
1997
Springer
92views Robotics» more  ECP 1997»
15 years 4 months ago
Understanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
Subbarao Kambhampati, Eric Parker, Eric Lambrecht
113
Voted
SOCO
2005
Springer
15 years 5 months ago
Flexible Binding for Reusable Composition of Web Services
Abstract. In addition to publishing composite services as reusable services, compositions can also be reused by applying them to orchestrate different component services. To do so...
Cesare Pautasso, Gustavo Alonso
AAAI
2010
15 years 1 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
128
Voted
TACS
2001
Springer
15 years 4 months ago
Lightweight Analysis of Object Interactions
The state of the practice in object-oriented software development has moved beyond reuse of code to reuse of conceptual structures such as design patterns. This paper draws attenti...
Daniel Jackson, Alan Fekete
ATAL
2006
Springer
15 years 4 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo