Sciweavers

4565 search results - page 62 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 5 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
GECCO
2008
Springer
100views Optimization» more  GECCO 2008»
13 years 10 months ago
Optimizing hierarchical menus by genetic algorithm and simulated annealing
Hierarchical menus are now ubiquitous. The performance of the menu depends on many factors: structure, layout, colors and so on. There has been extensive research on novel menus, ...
Shouichi Matsui, Seiji Yamada
CP
2003
Springer
14 years 2 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
CHI
2008
ACM
13 years 11 months ago
Genetic algorithm can optimize hierarchical menus
Hierarchical menus are now ubiquitous. The performance of the menu depends on many factors: structure, layout, colors and so on. There has been extensive research on novel menus, ...
Shouichi Matsui, Seiji Yamada