2467 search results - page 308 / 494 » Finite State Machines |
183
click to vote
JMLR
2010
15 years 1 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
218
click to vote
AIED
2011
Springer
14 years 10 months ago
2011
Springer
The Pedagogical Assessment Workflow System (PAWS) is a new workflow-based pedagogical assessment framework that enables the efficient and robust integration of diverse datasets for...
201
click to vote
PACT
2005
Springer
16 years 1 days ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
192
click to vote
TVCG
2010
15 years 4 months ago
2010
— Obtaining models of dynamic 3D objects is an important part of content generation for computer graphics. Numerous methods have been extended from static scenarios to model dyna...
152
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...