Sciweavers

699 search results - page 108 / 140
» The method of combinatorial telescoping
Sort
View
IAT
2003
IEEE
14 years 1 months ago
Classification Rule Discovery with Ant Colony Optimization
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...
Bo Liu, Hussein A. Abbass, Bob McKay
PPPJ
2003
ACM
14 years 1 months ago
A stochastic approach to automated design improvement
The object-oriented approach to software development facilitates and encourages programming practices that increase reusability, correctness and maintainability in code. This is a...
Mark Kent O'Keeffe, Mel Ó Cinnéide
APWEB
2003
Springer
14 years 1 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...
ISCC
2002
IEEE
14 years 1 months ago
Resource and performance management in wireless communication networks
In this paper, we study the problems of resource and performance management in channelized wireless networks. For identifying research issues systematically, we propose a research...
Chih-Hao Lin, Frank Yeong-Sung Lin
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
14 years 1 months ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl