Sciweavers

503 search results - page 52 / 101
» An Independence Relation for Sets of Secrets
Sort
View
ICDCS
1999
IEEE
15 years 2 months ago
Scalable Processing of Read-Only Transactions in Broadcast Push
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
Evaggelia Pitoura, Panos K. Chrysanthis
FCT
1999
Springer
15 years 2 months ago
A General Categorical Connection between Local Event Structures and Local Traces
Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary pr...
H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy
EPS
1998
Springer
15 years 2 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 1 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
SIGGRAPH
1987
ACM
15 years 1 months ago
Flocks, herds and schools: A distributed behavioral model
The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rar...
Craig W. Reynolds