Sciweavers

4565 search results - page 140 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
GECCO
1999
Springer
116views Optimization» more  GECCO 1999»
14 years 2 months ago
Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhon...
EUROCRYPT
2004
Springer
14 years 3 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
DAC
2006
ACM
14 years 11 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
COLOGNETWENTE
2010
13 years 9 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
13 years 10 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Philip N. Klein