Sciweavers

15416 search results - page 2813 / 3084
» Embeddings of Computable Structures
Sort
View
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 4 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
ICUMT
2009
15 years 4 months ago
Service and Resource Discovery supports over P2P overlays
We describe the main architecture and the design principles of the Service/Resource Discovery System (SRDS), a component of the XtreemOS Operating System. XtreemOS is a Linux exten...
Emanuele Carlini, Massimo Coppola, Patrizio Dazzi,...
ANOR
2010
153views more  ANOR 2010»
15 years 4 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant
AOR
2010
15 years 4 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
ICIP
2010
IEEE
15 years 4 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
« Prev « First page 2813 / 3084 Last » Next »