400 search results - page 26 / 80 » Extended formulations in combinatorial optimization |
117
click to vote
JAIR
2010
14 years 10 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
114
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
143
click to vote
GECCO
2011
Springer
14 years 3 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
107
click to vote
PPOPP
2005
ACM
15 years 5 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
108
click to vote
ICALP
2009
Springer
16 years 1 days ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...