733 search results - page 83 / 147 » Recommending random walks |
ICRA
1994
IEEE
15 years 1 months ago
1994
IEEE
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
AAAI
1997
14 years 11 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
TSP
2008
14 years 9 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
IJCSA
2007
14 years 9 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
While an exact stationarization of a process with a given spectrum magnitude can be obtained via a complete randomization of the spectrum phase (“surrogates” technique), we pr...