284 search results - page 55 / 57 » On the adaptable chromatic number of graphs |
134
Voted
CEC
2011
IEEE
14 years 17 days ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
114
Voted
STOC
2004
ACM
16 years 27 days ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
171
Voted
CORR
2010
Springer
15 years 21 days ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
110
Voted
WINET
2010
14 years 11 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
187
Voted
SIGMOD
2008
ACM
16 years 22 days ago
2008
ACM
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...