Sciweavers

714 search results - page 137 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
COMAD
2008
13 years 11 months ago
Towards the Preservation of Keys in XML Data Transformation for Integration
Transformation of a source schema with its conforming data to a target schema with its conforming data is an important activity in XML as two schemas in XML can represent same rea...
Md. Sumon Shahriar
EC
2008
146views ECommerce» more  EC 2008»
13 years 10 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
SCP
1998
107views more  SCP 1998»
13 years 9 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
CSCLP
2004
Springer
14 years 3 months 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
ATAL
2003
Springer
14 years 3 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara