Sciweavers

412 search results - page 64 / 83
» A New Proof of the F5 Algorithm
Sort
View
SPAA
2000
ACM
15 years 2 months ago
DCAS-based concurrent deques
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
Ole Agesen, David Detlefs, Christine H. Flood, Ale...
ECAI
2000
Springer
15 years 2 months ago
Towards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
Masashi Shimbo, Toru Ishida
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 2 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
COLT
2006
Springer
15 years 1 months ago
Maximum Entropy Distribution Estimation with Generalized Regularization
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
Miroslav Dudík, Robert E. Schapire
STRINGOLOGY
2008
14 years 11 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter