Sciweavers

4565 search results - page 107 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
ICCAD
1999
IEEE
76views Hardware» more  ICCAD 1999»
14 years 2 months ago
Optimal allocation of carry-save-adders in arithmetic optimization
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
Junhyung Um, Taewhan Kim, C. L. Liu
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
13 years 11 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Scheduling of Skippable Periodic Tasks with Energy Efficiency in Weakly Hard Real-Time System
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
Santhi Baskaran, P. Thambidurai
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 20 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
GECCO
2004
Springer
14 years 3 months ago
Systematic Integration of Parameterized Local Search Techniques in Evolutionary Algorithms
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...