2313 search results - page 85 / 463 » On Heuristic Time Hierarchies |
194
click to vote
PKC
2010
Springer
15 years 4 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
162
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
160
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
159
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
160
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...