Sciweavers

337 search results - page 66 / 68
» Game Theory Using Genetic Algorithms
Sort
View
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 10 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 2 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
BMCBI
2010
117views more  BMCBI 2010»
13 years 8 months ago
Automatic, context-specific generation of Gene Ontology slims
Background: The use of ontologies to control vocabulary and structure annotation has added value to genomescale data, and contributed to the capture and re-use of knowledge across...
Melissa J. Davis, Muhammad Shoaib B. Sehgal, Mark ...
MOBIHOC
2007
ACM
14 years 8 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
INFOCOM
2003
IEEE
14 years 1 months ago
Cooperation in Wireless Ad Hoc Networks
— In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the b...
Vikram Srinivasan, Pavan Nuggehalli, Carla-Fabiana...