1589 search results - page 143 / 318 » Multiple-Goal Heuristic Search |
138
click to vote
KER
2007
15 years 3 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
141
Voted
RTSS
2008
IEEE
15 years 9 months ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
112
Voted
CAEPIA
2007
Springer
15 years 7 months ago
2007
Springer
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...
102
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
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...
131
click to vote
IJAIT
2007
15 years 3 months ago
2007
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...