Sciweavers

5964 search results - page 393 / 1193
» A theory of speculative computation
Sort
View
203
Voted
COLING
1994
15 years 9 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 7 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
206
Voted
CPHYSICS
2008
161views more  CPHYSICS 2008»
15 years 7 months ago
Implementing peridynamics within a molecular dynamics code
Peridynamics (PD) is a continuum theory that employs a nonlocal model to describe material properties. In this context, nonlocal means that continuum points separated by a finite ...
Michael L. Parks, Richard B. Lehoucq, Steven J. Pl...
ENTCS
2008
89views more  ENTCS 2008»
15 years 7 months ago
On the Relationship between Filter Spaces and Weak Limit Spaces
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
Matthias Schröder
JC
2008
92views more  JC 2008»
15 years 7 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier