3082 search results - page 60 / 617 » New Bounds for the Controller Problem |
143
Voted
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
150
click to vote
HYBRID
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
128
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
130
Voted
EOR
2007
15 years 3 months ago
2007
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
150
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...