Sciweavers

741 search results - page 6 / 149
» Robust Constraint Solving Using Multiple Heuristics
Sort
View
SAGA
2001
Springer
14 years 29 days ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
CPAIOR
2007
Springer
14 years 2 months ago
Solving a Stochastic Queueing Control Problem with Constraint Programming
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
Daria Terekhov, J. Christopher Beck
ACML
2009
Springer
14 years 17 days ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
CONSTRAINTS
2008
89views more  CONSTRAINTS 2008»
13 years 8 months ago
A Reinforcement Learning Approach to Interval Constraint Propagation
When solving systems of nonlinear equations with interval constraint methods, it has often been observed that many calls to contracting operators do not participate actively to th...
Frédéric Goualard, Christophe Jerman...
AAAI
2007
13 years 11 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...