Israel A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein  Home/Search
Context
Related
| cs.technion.ac.il/~wagner/pu...vaw.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/~wagner/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Efficient graph search is a central issue in many aspects of AI. In most of existing work there is a distinction between the active "searcher", which both executes the algorithm and holds the memory, and the passive "searched graph", over which the searcher has no control at all. Large dynamic networks like the Internet, where the nodes are powerful computers and the links have narrow band and are heavily-loaded, call for a different paradigm, in which most of the burden of computing and... (Update)
Similar documents (at the sentence level):
7.1%: ANTS: Agents, Networks, Trees, and Subgraphs - Wagner, Lindenbaum, Bruckstein (1999) (Correct)
Active bibliography (related documents): More All
1.5: Cooperative Covering by Ant-Robots using Evaporating Traces - Wagner, Lindenbaum.. (1996) (Correct)
0.9: Hamiltonian(t) - An Ant-Inspired Heuristic for Recognizing.. - Wagner, Bruckstein (1999) (Correct)
0.4: Efficiently Exploring a Continuous Unknown Domain by.. - Wagner, Lindenbaum.. (1998) (Correct)
Similar documents based on text: More All
0.2: Multi-Agent Physical A* Using Large Pheromones - Ariel Felner Yaron (2004) (Correct)
0.1: On the Polygon-Search Conjecture - Lee, Park, Chwa (2000) (Correct)
0.1: A Generalized Uncertainty Principle and Sparse - Representation In Pairs (Correct)
BibTeX entry: (Update)
@article{ wagner98efficiently,
author = "Israel A. Wagner and Michael Lindenbaum and Alfred M. Bruckstein",
title = "Efficiently Searching a Graph by a Smell-Oriented Vertex Process",
journal = "Annals of Mathematics and Artificial Intelligence",
volume = "24",
number = "1-4",
pages = "211-223",
year = "1998",
url = "citeseer.ist.psu.edu/24783.html" }
Citations (may not include all citations):405 Depth-First Search and Linear Graph Algorithms (context) - Tarjan - 1972
251 The Ant System: Optimization by a Colony of Cooperating Agen.. - Dorigo, Maniezzo et al. - 1996
209 Computer Science Press (context) - Even, Algorithms - 1979
168 Real-Time Heuristic Search (context) - Korf - 1990
80 The Role of Exploration in Learning Control - Thrun - 1992
73 The Self-Avoiding Walk (context) - Madras, Slade - 1993
64 Efficient Exploration in Reinforcement Learning - Thrun
21 Short Random Walks on Graphs - Barnes, Feige - 1993
20 Random Walks, Universal Traversal Sequences, and the Complex.. (context) - Aleliunas, Karp et al. - 1979
10 Efficient Algorithms for Graph Manipulation (context) - Hopcroft, Tarjan - 1973
8 Graph learning with a nearest neighbor approach (context) - Koenig, Smirnov - 1996
6 Trading Space for Time in Undirected s \Gamma t Connectivity (context) - Broder, Karlin et al. - 1994
5 Smell as a Computational Resource - A Lesson We Can Learn fr.. (context) - Wagner, Lindenbaum et al.
4 the capability of finite automata in 2 and 3 dimensional spa.. (context) - Blum, Sakoda - 1977
4 the power of the compass, or, Why mazes are easier to search.. (context) - Blum, Kozen - 1978
4 Cooperative Covering by Ant-Robots using Evaporating Traces - Wagner, Lindenbaum et al. - 1996
3 Search in a Maze (context) - Gal, Anderson - 1990
3 Le problem des labyrinths (context) - Tarry
Documents on the same site (http://www.cs.technion.ac.il/~wagner/): More
An Interactive VLSI CAD Tool for Yield Estimation - Wagner, Koren (1995) (Correct)
Cooperative Covering by Ant-Robots using Evaporating Traces - Wagner, Lindenbaum.. (1996) (Correct)
Row Straightening via Local Interactions - Wagner, Bruckstein (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC