151 search results - page 2 / 31 » A Cost Analysis of Solving the Amnesia Problems |
PODS
2008
ACM
14 years 5 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
ISMIS
2009
Springer
14 years 7 hour ago
2009
Springer
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
IPL
2010
13 years 3 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
ICRA
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
JAIR
2000
13 years 5 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...