Sciweavers

1399 search results - page 176 / 280
» New Algorithms for k-Center and Extensions
Sort
View
LCN
2003
IEEE
14 years 2 months ago
Improving the Aggregate Throughput of Access Points in IEEE 802.11 Wireless LANs
In IEEE 802.11 wireless LANs, the DCF access method and the PCF access method operate alternatively within a superframe to service the time-varying traffic demands. Due to differ...
X. James Dong, Mustafa Ergen, Pravin Varaiya, Anuj...
AAMAS
2006
Springer
13 years 9 months ago
An Evolutionary Dynamical Analysis of Multi-Agent Learning in Iterated Games
In this paper, we investigate Reinforcement learning (RL) in multi-agent systems (MAS) from an evolutionary dynamical perspective. Typical for a MAS is that the environment is not ...
Karl Tuyls, Pieter Jan't Hoen, Bram Vanschoenwinke...
RECOMB
2005
Springer
14 years 9 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
ICCD
2008
IEEE
120views Hardware» more  ICCD 2008»
14 years 5 months ago
Near-optimal oblivious routing on three-dimensional mesh networks
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
Rohit Sunkam Ramanujam, Bill Lin
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
14 years 2 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su