4565 search results - page 554 / 913 » Time Optimal Self-Stabilizing Algorithms |
169
Voted
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
149
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
141
Voted
WISA
2004
Springer
15 years 9 months ago
2004
Springer
In implementing cryptographic algorithms on limited devices such as smart cards, speed and memory optimization had always been a challenge. With the advent of side channel attacks,...
107
click to vote
OOPSLA
1997
Springer
15 years 7 months ago
1997
Springer
Class libraries are generally designed with an emphasis on versatility and extensibility. Applications that use a library typically exercise only part of the library’s functiona...
145
Voted
ICPP
1993
IEEE
15 years 7 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...