3443 search results - page 211 / 689 » More Algebras for Determiners |
113
click to vote
AI
2008
Springer
15 years 27 days ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
127
Voted
BMCBI
2008
15 years 27 days ago
2008
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
98
Voted
ECCC
2007
15 years 22 days ago
2007
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain con...
120
click to vote
JACM
2007
15 years 20 days ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...