914 search results - page 89 / 183 » The Computational Complexity of Probabilistic Planning |
229
click to vote
ICOM
2011
14 years 7 months ago
2011
In this paper we describe an implicit user interface for smart environment control: We make our system guess how to assist the user(s) proactively. Our controller is based on two ...
130
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
142
click to vote
BIBE
2007
IEEE
15 years 10 months ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
148
Voted
ICTAI
2010
IEEE
15 years 2 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
155
click to vote
EGPGV
2004
Springer
15 years 9 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...