Sciweavers

2600 search results - page 285 / 520
» Clustering with or without the Approximation
Sort
View
ATAL
2008
Springer
15 years 8 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
201
Voted
LATIN
2010
Springer
15 years 8 months ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
153
Voted
AAAI
2006
15 years 7 months ago
Mixtures of Predictive Linear Gaussian Models for Nonlinear, Stochastic Dynamical Systems
The Predictive Linear Gaussian model (or PLG) improves upon traditional linear dynamical system models by using a predictive representation of state, which makes consistent parame...
David Wingate, Satinder P. Singh
BMVC
1997
15 years 7 months ago
Needle Map Recovery using Robust Regularizers
This article describes how robust error-kernels can be used as smoothness priors in recovering shape-from-shading (SFS). Conventionally, the smoothness error is added to the data-...
Philip L. Worthington, Edwin R. Hancock