701 search results - page 118 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
134
Voted
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
139
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
162
Voted
STACS
1992
Springer
15 years 7 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
153
click to vote
CCCG
2003
15 years 4 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
153
Voted
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...