Sciweavers

3250 search results - page 390 / 650
» An Algorithm to Solve a Linear Program
Sort
View
AIPS
2004
15 years 8 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
JMLR
2006
89views more  JMLR 2006»
15 years 6 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
16 years 8 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
ICRA
2003
IEEE
143views Robotics» more  ICRA 2003»
15 years 12 months ago
Cooperative task planning of multi-robot systems with temporal constraints
This paper discusses a design methodology of cooperative trajectory generation for multi-robot systems. The trajectory of achieving cooperative tasks, i.e., with temporal constrai...
Feng-Li Lian, Richard M. Murray
EMNLP
2010
15 years 4 months ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...