Sciweavers

102 search results - page 19 / 21
» Hyper-heuristics for the dynamic variable ordering in constr...
Sort
View
CP
2001
Springer
13 years 12 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
JUCS
2010
160views more  JUCS 2010»
13 years 5 months ago
LCP-Nets: A Linguistic Approach for Non-functional Preferences in a Semantic SOA Environment
Abstract: This paper addresses the problem of expressing preferences among nonfunctional properties of services in a Web service architecture. In such a context, semantic and non-f...
Pierre Châtel, Isis Truck, Jacques Malenfant
AAAI
2000
13 years 8 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
ATAL
2005
Springer
14 years 28 days ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
CSCLP
2004
Springer
14 years 24 days ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry