693 search results - page 13 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
140
click to vote
AAAI
2006
15 years 3 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
113
click to vote
AIPS
2006
15 years 3 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
104
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
115
click to vote
CEC
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
131
Voted
ICPPW
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...