2436 search results - page 323 / 488 » Comonadic Notions of Computation |
147
click to vote
JELIA
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
146
Voted
PPSN
1998
Springer
15 years 8 months ago
1998
Springer
The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA tes...
152
Voted
FPGA
1997
ACM
15 years 8 months ago
1997
ACM
This paper describes an application in high-performance signal processing using reconfigurable computing engines: a 250 MHz cross-correlator for radio astronomy. Experimental resu...
123
click to vote
MFCS
1997
Springer
15 years 8 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
STACS
1997
Springer
15 years 8 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...