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...
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...
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...
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 ...
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...