Sciweavers

2629 search results - page 494 / 526
» complex 2009
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 4 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
GECCO
2009
Springer
15 years 4 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
ICN
2009
Springer
15 years 4 months ago
Measuring Route Diversity in the Internet from Remote Vantage Points
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...
Andrea Di Menna, Tiziana Refice, Luca Cittadini, G...
ISEUD
2009
Springer
15 years 4 months ago
Improving Documentation for eSOA APIs through User Studies
All software today is written using libraries, toolkits, frameworks and other application programming interfaces (APIs). We performed a user study of the online documentation a lar...
Sae Young Jeong, Yingyu Xie, Jack Beaton, Brad A. ...
ISVC
2009
Springer
15 years 4 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House