Sciweavers

10718 search results - page 339 / 2144
» On the Circuit Implementation Problem
Sort
View
ORL
2000
77views more  ORL 2000»
15 years 6 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ICTAI
2003
IEEE
16 years 22 hour ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 11 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
NETWORKS
2007
15 years 6 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 8 months ago
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Andrew V. Goldberg