Sciweavers

463 search results - page 60 / 93
» The Most Reliable Subgraph Problem
Sort
View
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 3 months ago
Self-adaptive mutation in XCSF
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
Martin V. Butz, Patrick O. Stalph, Pier Luca Lanzi
128
Voted
AMC
2007
129views more  AMC 2007»
15 years 2 months ago
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
109
Voted
COMCOM
2006
92views more  COMCOM 2006»
15 years 1 months ago
Loss and Delay Measurements of Internet Backbones
As the Internet evolves into a universal network for all communication needs, it has to stand up to the high quality standards of traditional networks, such as the telephone netwo...
Athina Markopoulou, Fouad A. Tobagi, Mansour J. Ka...
138
Voted
JCIT
2008
154views more  JCIT 2008»
15 years 1 months ago
A Multi-Agent Framework for Testing 3-Tier Distributed Systems Architecture
Lack of time and capital for software testing is an oft encountered problem in most organizations. The plethora of possible test cases for each software component makes software t...
Sunitha Ramanujam, Hany F. El Yamany, Miriam A. M....
SAC
2006
ACM
15 years 1 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen