Sciweavers

1662 search results - page 210 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
PPL
2010
117views more  PPL 2010»
13 years 3 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
FLAIRS
2006
13 years 10 months ago
GFAM: Evolving Fuzzy ARTMAP Neural Networks
Fuzzy ARTMAP (FAM) is one of the best neural network architectures in solving classification problems. One of the limitations of Fuzzy ARTMAP that has been extensively reported in...
Ahmad Al-Daraiseh, Michael Georgiopoulos, Annie S....
INFOCOM
2006
IEEE
14 years 2 months ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
IPPS
2005
IEEE
14 years 2 months ago
A Cellular Multi-Objective Genetic Algorithm for Optimal Broadcasting Strategy in Metropolitan MANETs
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
Enrique Alba, Bernabé Dorronsoro, Francisco...
PERVASIVE
2005
Springer
14 years 2 months ago
Parasitic Mobility for Pervasive Sensor Networks
Distributed sensor networks offer many new capabilities for contextually monitoring environments. By making such systems mobile, we increase the application-space for the distribut...
Mathew Laibowitz, Joseph A. Paradiso