Sciweavers

2814 search results - page 509 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 21 days ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
ATAL
2006
Springer
14 years 17 days ago
Learning to cooperate in multi-agent social dilemmas
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...
Jose Enrique Munoz de Cote, Alessandro Lazaric, Ma...
CIKM
2008
Springer
13 years 10 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
IMC
2007
ACM
13 years 10 months ago
Understanding the limitations of transmit power control for indoor wlans
A wide range of transmit power control (TPC) algorithms have been proposed in recent literature to reduce interference and increase capacity in 802.11 wireless networks. However, ...
Vivek Shrivastava, Dheeraj Agrawal, Arunesh Mishra...
AI
2010
Springer
13 years 9 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim