3267 search results - page 560 / 654 » Generalized quasirandom graphs |
135
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
147
click to vote
EDBTW
2006
Springer
15 years 8 months ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
136
click to vote
EMSOFT
2006
Springer
15 years 8 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
141
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
157
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...