Sciweavers

7065 search results - page 1129 / 1413
» Iterative Scheduling Algorithms
Sort
View
INFOCOM
2003
IEEE
15 years 12 months ago
Energy Efficient Routing in Ad Hoc Disaster Recovery Networks
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...
Gil Zussman, Adrian Segall
EVOW
2003
Springer
15 years 12 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
GECCO
2003
Springer
142views Optimization» more  GECCO 2003»
15 years 12 months ago
Revisiting Elitism in Ant Colony Optimization
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
Tony White, Simon Kaegi, Terri Oda
CONCUR
2001
Springer
15 years 11 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
EUROPAR
2001
Springer
15 years 11 months ago
Performance of High-Accuracy PDE Solvers on a Self-Optimizing NUMA Architecture
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
Sverker Holmgren, Dan Wallin
« Prev « First page 1129 / 1413 Last » Next »