363 search results - page 45 / 73 » Decomposition of the NVALUE constraint |
INFORMS
2000
14 years 9 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
DCG
1998
14 years 9 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
76
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
65
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Supervised learning of a parts-based model can be for-
mulated as an optimization problem with a large (exponen-
tial in the number of parts) set of constraints. We show how
thi...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...