242 search results - page 20 / 49 » Provably Bounded Optimal Agents |
SMI
2005
IEEE
14 years 1 months ago
2005
IEEE
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
ADHOCNOW
2003
Springer
14 years 1 months ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signi...
UAI
2004
13 years 9 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...