2413 search results - page 295 / 483 » Understanding the problem |
135
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
150
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
132
Voted
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
135
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
160
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...