Sciweavers

2976 search results - page 204 / 596
» On the bounded integer programming
Sort
View
DAC
2006
ACM
16 years 7 months ago
Optimal cell flipping in placement and floorplanning
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
Chiu-Wing Sham, Evangeline F. Y. Young, Chris C. N...
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
15 years 10 months ago
Linear Programming Polytope and Algorithm for Mean Payoff Games
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
Ola Svensson, Sergei G. Vorobyov
MCU
2007
95views Hardware» more  MCU 2007»
15 years 8 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud
ORL
2007
66views more  ORL 2007»
15 years 6 months ago
Linear programming with online learning
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
CCE
2004
15 years 6 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis