Sciweavers

5580 search results - page 1089 / 1116
» Randomized priority algorithms
Sort
View
SPAA
2003
ACM
14 years 1 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ATAL
2003
Springer
14 years 29 days ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...
GECCO
2003
Springer
14 years 29 days ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 29 days ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf
FOCS
2002
IEEE
14 years 21 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
« Prev « First page 1089 / 1116 Last » Next »