2536 search results - page 126 / 508 » Constructing Optimal Highways |
STOC
1989
ACM
15 years 3 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
114
click to vote
GD
2000
Springer
15 years 3 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
106
click to vote
PLDI
1995
ACM
15 years 3 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
102
click to vote
CEC
2008
IEEE
15 years 1 months ago
2008
IEEE
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...
OPODIS
2004
15 years 1 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...