Sciweavers

955 search results - page 13 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
IAT
2003
IEEE
14 years 1 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings
JUCS
2006
97views more  JUCS 2006»
13 years 7 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
IFIP12
2004
13 years 9 months ago
A Decision Support System (DSS) for the Railway Scheduling Problem
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
Laura Paola Ingolotti, María Pilar Tormos, ...
CEC
2009
IEEE
13 years 12 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
FOCS
1999
IEEE
14 years 6 days ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning