Sciweavers

1921 search results - page 5 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
NIPS
2007
13 years 9 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
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
14 years 1 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
ICML
1995
IEEE
14 years 8 months ago
Learning to Make Rent-to-Buy Decisions with Systems Applications
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
P. Krishnan, Philip M. Long, Jeffrey Scott Vitter
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
14 years 1 months ago
Do additional objectives make a problem harder?
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...

Publication
352views
14 years 3 months ago
Efficient methods for near-optimal sequential decision making under uncertainty
This chapter discusses decision making under uncertainty. More specifically, it offers an overview of efficient Bayesian and distribution-free algorithms for making near-optimal se...
Christos Dimitrakakis