Sciweavers

2911 search results - page 199 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
DLT
2009
15 years 4 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin
GECCO
2009
Springer
164views Optimization» more  GECCO 2009»
15 years 4 months ago
Solving iterated functions using genetic programming
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
Michael D. Schmidt, Hod Lipson
ICDAR
2009
IEEE
15 years 4 months ago
Issues in Performance Evaluation: A Case Study of Math Recognition
Performance evaluation of document recognition systems is a difficult and practically important problem. Issues arise in defining requirements, in characterizing the system's...
Adrien Lapointe, Dorothea Blostein
COGSCI
2011
49views more  COGSCI 2011»
15 years 1 months ago
What a Rational Parser Would Do
This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to qui...
John T. Hale
STTT
2010
113views more  STTT 2010»
15 years 1 months ago
Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm