Sciweavers

16596 search results - page 252 / 3320
» Generalized Assignment Problems
Sort
View
3DPVT
2006
IEEE
240views Visualization» more  3DPVT 2006»
16 years 23 days ago
Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
Timo Stich, Art Tevs, Marcus A. Magnor
COMPGEOM
2007
ACM
15 years 10 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
ATAL
2010
Springer
15 years 7 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
15 years 5 months ago
A general Gaussian-mixture approach for range-only mapping using multiple hypotheses
— Radio signal-based localization and mapping is becoming more interesting as applications involving the collaboration between robots and static wireless devices are more common....
Fernando Caballero, Luis Merino, Aníbal Oll...
ORL
1998
116views more  ORL 1998»
15 years 6 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...