Sciweavers

707 search results - page 63 / 142
» Solving path problems on the GPU
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 3 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
CN
2007
154views more  CN 2007»
14 years 12 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
SIGMETRICS
2008
ACM
14 years 11 months ago
A Diophantine model of routes in structured P2P overlays
Abstract-- An important intrinsic property of any structured Peer-to-Peer (P2P) overlay is multi-hop paths. Understanding their structure helps to solve challenging problems relate...
Dmitry Korzun, Andrei Gurtov
CDC
2009
IEEE
157views Control Systems» more  CDC 2009»
15 years 4 months ago
On trajectory optimization for active sensing in Gaussian process models
Abstract— We consider the problem of optimizing the trajectory of a mobile sensor with perfect localization whose task is to estimate a stochastic, perhaps multidimensional fiel...
Jerome Le Ny, George J. Pappas
CORR
2004
Springer
106views Education» more  CORR 2004»
14 years 11 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer