Sciweavers

3894 search results - page 458 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CRV
2007
IEEE
101views Robotics» more  CRV 2007»
15 years 8 months ago
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...
Pawel Zebrowski, Yaroslav Litus, Richard T. Vaugha...
128
Voted
NIPS
2007
15 years 6 months ago
Agreement-Based Learning
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
Percy Liang, Dan Klein, Michael I. Jordan
WSC
2000
15 years 6 months ago
A practical approach to sample-path simulation optimization
We propose solving continuous parametric simulation optimizations using a deterministic nonlinear optimization algorithm and sample-path simulations. The optimization problem is w...
Michael C. Ferris, Todd S. Munson, Krung Sinapirom...
JMLR
2006
97views more  JMLR 2006»
15 years 4 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke
TSMC
2008
136views more  TSMC 2008»
15 years 4 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore