Sciweavers

119 search results - page 12 / 24
» Solving POMDPs using quadratically constrained linear progra...
Sort
View
ECCV
1998
Springer
15 years 11 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
15 years 10 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
15 years 2 months ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
14 years 9 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
84
Voted
CPAIOR
2007
Springer
15 years 3 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen