Sciweavers

635 search results - page 29 / 127
» Four states are enough!
Sort
View
SIGUCCS
2000
ACM
13 years 11 months ago
Strategic Partnerships for Managing Labs
At Iowa State University, the Office of Academic Information Technologies, the English Department, and the Department of Residence have developed a strategic alliance to plan and ...
Linda J. Hutchison, Dennis J. Engholm
CG
2010
Springer
13 years 5 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine
CVPR
2006
IEEE
14 years 9 months ago
Quantitative Evaluation of Near Regular Texture Synthesis Algorithms
Near regular textures are pervasive in man-made and natural world. Their global regularity and local randomness pose new difficulties to the state of the art texture analysis and ...
Wen-Chieh Lin, James Hays, Chenyu Wu, Yanxi Liu, V...
HYBRID
2003
Springer
14 years 25 days ago
Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
Ronojoy Ghosh, Ashish Tiwari, Claire Tomlin
LATIN
1992
Springer
13 years 11 months ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin