Sciweavers

12194 search results - page 2376 / 2439
» Numberings Optimal for Learning
Sort
View
108
Voted
SIGOPSE
2004
ACM
15 years 6 months ago
Defending against eclipse attacks on overlay networks
Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains pointers to a set of neighbor no...
Atul Singh, Miguel Castro, Peter Druschel, Antony ...
SPAA
2004
ACM
15 years 6 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
FSTTCS
2004
Springer
15 years 6 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
15 years 6 months ago
Is the Predicted ESS in the Sequential Assessment Game Evolvable?
The Sequential Assessment Game model of animal contests predicts an evolutionarily stable strategy (ESS) that is a sequence of thresholds for giving up. Simulated evolution experim...
Winfried Just, Xiaolu Sun
108
Voted
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 6 months ago
A Study of the Role of Single Node Mutation in Genetic Programming
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
Wei Quan, Terence Soule
« Prev « First page 2376 / 2439 Last » Next »