1429 search results - page 255 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
CGF
2007
13 years 7 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
ML
2002
ACM
13 years 7 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
TON
1998
13 years 7 months ago
1998
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
IJRR
2010
13 years 6 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...