Sciweavers

23 search results - page 4 / 5
» A Comparison of Search Strategies for Geometric Branch and B...
Sort
View
FLAIRS
2008
13 years 11 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
AI
1999
Springer
13 years 8 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
TCS
2008
13 years 8 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
JMLR
2008
159views more  JMLR 2008»
13 years 8 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
PEPM
2007
ACM
14 years 2 months ago
Poly-controlled partial evaluation in practice
Poly-Controlled Partial Evaluation (PCPE) is a powerful approach to partial evaluation, which has recently been proposed. PCPE takes into account sets of control strategies instea...
Claudio Ochoa, Germán Puebla