Sciweavers

204 search results - page 24 / 41
» Information Operator Scheduling by Genetic Algorithms
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
Changhee Joo, Ness B. Shroff
GECCO
2003
Springer
14 years 1 months 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
117views Optimization» more  GECCO 2003»
14 years 1 months ago
A Method for Handling Numerical Attributes in GA-Based Inductive Concept Learners
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
Federico Divina, Maarten Keijzer, Elena Marchiori
AAAI
1998
13 years 10 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 8 months ago
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
Minyu Fang, David Malone, Ken R. Duffy, Douglas J....