Sciweavers

451 search results - page 33 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
NIPS
2004
13 years 10 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
WSC
2004
13 years 10 months ago
Experimental Performance Evaluation of Histogram Approximation for Simulation Output Analysis
We summarize the results of an experimental performance evaluation of using an empirical histogram to approximate the steady-state distribution of the underlying stochastic proces...
E. Jack Chen, W. David Kelton
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 8 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
EGH
2009
Springer
13 years 6 months ago
Data-parallel rasterization of micropolygons with defocus and motion blur
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. We design and analyze the costs of three alternative data-parallel algorithms for ra...
Kayvon Fatahalian, Edward Luong, Solomon Boulos, K...
MMSP
2008
IEEE
216views Multimedia» more  MMSP 2008»
14 years 3 months ago
Using stochastic gradient-descent scheme in appearance model based face tracking
— Active appearance model (AAM) has been widely used in face tracking and recognition. However, accuracy and efficiency are always two main challenges with the AAM search. The pa...
Zhidong Li, Jing Chen, Adrian Chong, Zhenghua Yu, ...