Sciweavers

282 search results - page 16 / 57
» Probabilistic Timed Behavior Trees
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Zhenyu Xu, Pradip K. Srimani
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
COLING
2008
13 years 9 months ago
A Syntactic Time-Series Model for Parsing Fluent and Disfluent Speech
This paper describes an incremental approach to parsing transcribed spontaneous speech containing disfluencies with a Hierarchical Hidden Markov Model (HHMM). This model makes use...
Tim Miller, William Schuler
AAAI
2004
13 years 9 months ago
PROBCONS: Probabilistic Consistency-Based Multiple Alignment of Amino Acid Sequences
Obtaining an accurate multiple alignment of protein sequences is a difficult computational problem for which many heuristic techniques sacrifice optimality to achieve reasonable r...
Chuong B. Do, Michael Brudno, Serafim Batzoglou
AAAI
2006
13 years 9 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch