10051 search results - page 1435 / 2011 » A Dynamic Separator Algorithm |
194
click to vote
MIDDLEWARE
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
192
click to vote
ROBOCUP
2007
Springer
16 years 24 days ago
2007
Springer
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
181
click to vote
SARA
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
152
click to vote
SARA
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just return...
148
click to vote
VLDB
2007
ACM
16 years 23 days ago
2007
ACM
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...