Sciweavers

5263 search results - page 690 / 1053
» Open Constraint Optimization
Sort
View
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 7 months ago
Multirobot rendezvous with visibility sensors in nonconvex environments
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
Anurag Ganguli, Jorge Cortés, Francesco Bul...
EOR
2006
73views more  EOR 2006»
15 years 7 months ago
Enforcing minimum run length in the cutting stock problem
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
JAIR
2008
98views more  JAIR 2008»
15 years 7 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 7 months ago
Scaling Laws of Cognitive Networks
—Opportunistic secondary spectrum usage has the potential to dramatically increase spectral efficiency and rates of a network of secondary cognitive users. In this work we consi...
Mai Vu, Natasha Devroye, Masoud Sharif, Vahid Taro...
JMLR
2006
125views more  JMLR 2006»
15 years 7 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer