Sciweavers

187 search results - page 17 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
ICTAI
2003
IEEE
15 years 2 months ago
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique dec...
Kenny Qili Zhu
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
67
Voted
DAC
2006
ACM
15 years 10 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
ASPDAC
2004
ACM
141views Hardware» more  ASPDAC 2004»
15 years 3 months ago
An approach for reducing dynamic power consumption in synchronous sequential digital designs
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
Noureddine Chabini, Wayne Wolf
PC
2002
118views Management» more  PC 2002»
14 years 9 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin