Sciweavers

823 search results - page 3 / 165
» Stateful Subset Cover
Sort
View
NIPS
2007
13 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
ICCD
2001
IEEE
77views Hardware» more  ICCD 2001»
14 years 6 months ago
Minimal Subset Evaluation: Rapid Warm-Up for Simulated Hardware State
This paper introduces minimal subset evaluation (MSE) as a way to reduce time spent on large-structure warm-up during the fastforwarding portion of processor simulations. Warm up ...
John W. Haskins Jr., Kevin Skadron
SPAA
2010
ACM
14 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 9 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
RSA
2011
131views more  RSA 2011»
13 years 4 months ago
On covering by translates of a set
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
Béla Bollobás, Svante Janson, Oliver...