Sciweavers

350 search results - page 30 / 70
» Branching Programs for Tree Evaluation
Sort
View
ESOP
2001
Springer
14 years 1 days ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
QEST
2007
IEEE
14 years 1 months ago
Stochastic Game Logic
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
Christel Baier, Tomás Brázdil, Marcu...
NIPS
2007
13 years 9 months ago
A Probabilistic Approach to Language Change
We present a probabilistic approach to language change in which word forms are represented by phoneme sequences that undergo stochastic edits along the branches of a phylogenetic ...
Alexandre Bouchard-Côté, Percy Liang,...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 7 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
ACG
2009
Springer
14 years 2 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson