Sciweavers

1632 search results - page 213 / 327
» On special numberings of hypergraphs
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ATAL
2008
Springer
15 years 8 months ago
Replacing the stop sign: unmanaged intersection control for autonomous vehicles
As computers inevitably begin to replace humans as the drivers of automobiles, our current human-centric traffic management mechanisms will give way to hyper-efficient systems and...
Mark Van Middlesworth, Kurt M. Dresner, Peter Ston...
CASES
2008
ACM
15 years 8 months ago
Execution context optimization for disk energy
Power, energy, and thermal concerns have constrained embedded systems designs. Computing capability and storage density have increased dramatically, enabling the emergence of hand...
Jerry Hom, Ulrich Kremer
CEC
2008
IEEE
15 years 8 months ago
Multilevel cooperative coevolution for large scale optimization
In this paper, we propose a multilevel cooperative coevolution (MLCC) framework for large scale optimization problems. The motivation is to improve our previous work on grouping ba...
Zhenyu Yang, Ke Tang, Xin Yao
COCOON
2005
Springer
15 years 8 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...