335 search results - page 35 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
144
Voted
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
126
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
162
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
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)...
151
click to vote
CN
2007
15 years 3 months ago
2007
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
120
Voted
AAAI
1990
15 years 4 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...