105 search results - page 12 / 21 » Persistence in discrete optimization under data uncertainty |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— This paper investigates the reliability of applicationlevel multicast based on a distributed hash table (DHT) in a highly dynamic network. Using a node residual lifetim...
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
101
Voted
DATESO
2008
14 years 11 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
182
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a novel distributed framework for multi-target tracking with an efficient data association computation. A decentralized representation of trackers' motion...