3433 search results - page 137 / 687 » Heuristics for a bidding problem |
183
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
146
click to vote
KI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
148
click to vote
AAAI
2004
15 years 8 months ago
2004
We present a general framework for studying heuristics for planning in the belief space. Earlier work has focused on giving implementations of heuristics that work well on benchma...
151
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
155
click to vote
TPDS
2008
2008
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
15 years 6 months ago
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...