Sciweavers

777 search results - page 68 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
CIMCA
2008
IEEE
14 years 2 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 18 days ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
VC
2008
190views more  VC 2008»
13 years 7 months ago
Fast collision detection using the A-buffer
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...
Han-Young Jang, JungHyun Han
FOCS
2005
IEEE
14 years 1 months ago
The Parking Permit Problem
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
Adam Meyerson
IPL
2010
115views more  IPL 2010»
13 years 6 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister