Sciweavers

387 search results - page 74 / 78
» Many Random Walks Are Faster Than One
Sort
View
IJCAI
2001
13 years 10 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
ANLP
2000
141views more  ANLP 2000»
13 years 10 months ago
Aggressive Morphology for Robust Lexical Coverage
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
William A. Woods
SIAMCOMP
2010
109views more  SIAMCOMP 2010»
13 years 3 months ago
Analysis of Delays Caused by Local Synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
SIGGRAPH
1997
ACM
14 years 1 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas