367 search results - page 44 / 74 » Tight lower bounds for the online labeling problem |
JAIR
2008
13 years 7 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...