5289 search results - page 459 / 1058 » Evolutionary Computation for Modeling and Optimization |
186
click to vote
ALGORITHMICA
1999
15 years 6 months ago
1999
Consider an on-line player who needs some equipment (e.g., a computer) for an initially unknown number of periods. At the start of each period it is determined whether the player w...
180
click to vote
IPSN
2004
Springer
16 years 5 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
174
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
168
click to vote
ICCCN
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
197
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...