Sciweavers

2108 search results - page 193 / 422
» Constrained Heuristic Search
Sort
View
CAEPIA
2007
Springer
15 years 10 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
15 years 6 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
IJAIT
2007
119views more  IJAIT 2007»
15 years 6 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
JCDL
2011
ACM
218views Education» more  JCDL 2011»
14 years 9 months ago
Retrieving attributes using web tables
In this paper we propose an attribute retrieval approach which extracts and ranks attributes from Web tables. We use simple heuristics to filter out improbable attributes and we ...
Arlind Kopliku, Karen Pinel-Sauvagnat, Mohand Boug...
ATAL
2010
Springer
15 years 6 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...