4940 search results - page 136 / 988 » On the Complexity of Universal Programs |
121
click to vote
HPDC
1996
IEEE
15 years 8 months ago
1996
IEEE
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursi...
146
click to vote
FOSSACS
2011
Springer
14 years 8 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
156
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
302
click to vote
DIMACS
1996
15 years 6 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
140
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Many genome projects are left unfinished due to complex, repeated regions. Finishing is the most time consuming step in sequencing and current finishing tools are not ...