2436 search results - page 311 / 488 » Evaluating Adaptive Problem Selection |
161
click to vote
AIPS
2006
15 years 5 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
141
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
144
click to vote
PVLDB
2010
15 years 2 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
141
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—With the power consumption issue of mobile handset taken into account, Single-carrier FDMA (SC-FDMA) has been selected for 3GPP Long-Term Evolution (LTE) uplink multiple access ...
113
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronoun...