Sciweavers

3320 search results - page 125 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ICC
2007
IEEE
138views Communications» more  ICC 2007»
16 years 26 days ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy
AE
2005
Springer
16 years 2 days ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
EVOW
2006
Springer
15 years 10 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
COR
2008
118views more  COR 2008»
15 years 6 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ANOR
2011
169views more  ANOR 2011»
14 years 10 months ago
Predetermined intervals for start times of activities in the stochastic project scheduling problem
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
Illana Bendavid, Boaz Golany