Sciweavers

594 search results - page 71 / 119
» Travelling Miser Problem
Sort
View
ADHOC
2005
116views more  ADHOC 2005»
13 years 7 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 7 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson

Book
7793views
15 years 6 months ago
Introduction to Neural Networks for C#
"Introduction to Neural Networks fpr C#, Second Edition, introduces the C# programmer to the world of Neural Networks and Artificial Intelligence. Neural network architectures...
Jeff Heaton
LION
2007
Springer
139views Optimization» more  LION 2007»
14 years 2 months ago
Evolution of Fitness Functions to Improve Heuristic Performance
In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective ...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 1 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese