Sciweavers

5153 search results - page 455 / 1031
» Introduction to Randomized Algorithms
Sort
View
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
16 years 24 days ago
Bandit-Based Genetic Programming
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
Jean-Baptiste Hoock, Olivier Teytaud
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CONCUR
2006
Springer
15 years 10 months ago
Probability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
Roberto Segala
ECCV
2006
Springer
15 years 10 months ago
Quasi-conformal Flat Representation of Triangulated Surfaces for Computerized Tomography
In this paper we present a simple method for flattening of triangulated surfaces for mapping and imaging. The method is based on classical results of F. Gehring and Y. V
Eli Appleboim, Emil Saucan, Yehoshua Y. Zeevi
ACL
1994
15 years 7 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin