Sciweavers

3018 search results - page 271 / 604
» Replicating for Performance: Case Studies
Sort
View
CEC
2007
IEEE
15 years 6 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 6 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ADHOC
2005
122views more  ADHOC 2005»
15 years 6 months ago
Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
Hai Liu, Xiaohua Jia, Deying Li, Chan-Hee Lee
ISAMI
2010
15 years 4 months ago
A Data Mining Approach for the Detection of High-Risk Breast Cancer Groups
It is widely agreed that complex diseases are typically caused by the joint effects of multiple instead of a single genetic variation. These genetic variations may show very little...
Orlando Anunciação, Bruno C. Gomes, ...
178
Voted
CORR
2011
Springer
192views Education» more  CORR 2011»
15 years 1 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...