417 search results - page 17 / 84 » Running Time Predictions for Factoring Algorithms |
100
click to vote
EGPGV
2004
Springer
15 years 3 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
FSKD
2005
Springer
15 years 3 months ago
2005
Springer
Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
AAIM
2010
Springer
15 years 29 days ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
122
click to vote
CSCW
2012
ACM
13 years 5 months ago
2012
ACM
Users have come to rely on automated route finding services for driving, public transit, walking, and bicycling. Current state of the art route finding algorithms typically rely...