Sciweavers

4451 search results - page 361 / 891
» On Random Ordering Constraints
Sort
View
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
15 years 6 months ago
Gibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
Wei Xi, Xiaobo Tan, John S. Baras
IJCV
2008
266views more  IJCV 2008»
15 years 6 months ago
Learning to Recognize Objects with Little Supervision
This paper shows (i) improvements over state-of-the-art local feature recognition systems, (ii) how to formulate principled models for automatic local feature selection in object c...
Peter Carbonetto, Gyuri Dorkó, Cordelia Sch...
IOR
2006
93views more  IOR 2006»
15 years 6 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
IOR
2006
173views more  IOR 2006»
15 years 6 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
JCC
2007
70views more  JCC 2007»
15 years 6 months ago
Self-organizing superimposition algorithm for conformational sampling
Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...
Fangqiang Zhu, Dimitris K. Agrafiotis