Sciweavers

2725 search results - page 52 / 545
» Constraint Solving for Interpolation
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
CP
2007
Springer
14 years 4 months ago
Solving the Salinity Control Problem in a Potable Water System
Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the wi...
Chiu Wo Choi, Jimmy Ho-Man Lee
IEAAIE
2001
Springer
14 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
DATESO
2007
103views Database» more  DATESO 2007»
13 years 11 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
ECAIW
2000
Springer
14 years 2 months ago
Solving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
Jean-Philippe Hamiez, Jin-Kao Hao