Sciweavers

2343 search results - page 339 / 469
» The Locomotive Routing Problem
Sort
View
INFOCOM
2003
IEEE
15 years 10 months ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
164
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
Random Waypoint Considered Harmful
— This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady stat...
Jungkeun Yoon, Mingyan Liu, Brian Noble
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
15 years 10 months ago
Multi-FPGA Systems Synthesis by Means of Evolutionary Computation
Abstract. Multi-FPGA systems (MFS) are used for a great variety of applications, for instance, dynamically re-configurable hardware applications, digital circuit emulation, and num...
José Ignacio Hidalgo, Francisco Ferná...
IFIP
2003
Springer
15 years 10 months ago
Self-Organising Node Address Management in Ad Hoc Networks
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...
Stephen Toner, Donal O'Mahony
ICNP
2000
IEEE
15 years 9 months ago
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
This paper considers the problem of providing a geocast service in mobile ad hoc networks and presents a novel geocasting algorithm combining unicasting and flooding. Geocast is ...
Young-Bae Ko, Nitin H. Vaidya