179 search results - page 13 / 36 » Space Bounded Computations: Review And New Separation Result... |
101
click to vote
AAAI
2006
14 years 12 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
EOR
2008
14 years 10 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
CHI
2011
ACM
14 years 2 months ago
2011
ACM
This work explores the intersection between infographics and games by examining how to embed meaningful visual analytic interactions into game mechanics that in turn impact user b...
115
click to vote
COCO
2009
Springer
15 years 5 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
DCC
2008
IEEE
15 years 10 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...