Sciweavers

284 search results - page 55 / 57
» On the adaptable chromatic number of graphs
Sort
View
CEC
2011
IEEE
12 years 5 months ago
Cost-benefit analysis of using heuristics in ACGP
—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...
John W. Aleshunas, Cezary Z. Janikow
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
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...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
CORR
2010
Springer
338views Education» more  CORR 2010»
13 years 5 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
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 ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
WINET
2010
185views more  WINET 2010»
13 years 4 months ago
TDMA scheduling algorithms for wireless sensor networks
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...
Sinem Coleri Ergen, Pravin Varaiya
SIGMOD
2008
ACM
116views Database» more  SIGMOD 2008»
14 years 5 months ago
SPADE: the system s declarative stream processing engine
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 ...
Bugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip...