725 search results - page 137 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
191
Voted
STACS
1999
Springer
15 years 10 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...
170
click to vote
SODA
2000
ACM
15 years 7 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...
236
Voted
EDO
2006
Springer
15 years 9 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...
174
Voted
ALT
1995
Springer
15 years 9 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...
184
Voted
MICAI
2005
Springer
15 years 11 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...