Sciweavers

1639 search results - page 148 / 328
» Anytime Heuristic Search
Sort
View
IJAIT
2007
119views more  IJAIT 2007»
13 years 10 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»
13 years 1 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...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 1 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
TSMC
2010
13 years 4 months ago
Optimizing Discounted Cash Flows in Project Scheduling - An Ant Colony Optimization Approach
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
Wei-neng Chen, Jun Zhang, Henry Shu-Hung Chung, Ru...
IJCAI
1997
13 years 11 months ago
Exploiting Domain Knowledge for Approximate Diagnosis
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...
Annette ten Teije, Frank van Harmelen