725 search results - page 137 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
118
click to vote
STACS
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
105
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
151
Voted
EDO
2006
Springer
15 years 3 months ago
2006
Springer
Server applications with adaptive behaviors can adapt their functionality in response to environmental changes, and significantly reduce the on-going costs of system deployment an...
108
click to vote
ALT
1995
Springer
15 years 3 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
109
click to vote
MICAI
2005
Springer
15 years 5 months ago
2005
Springer
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...