615 search results - page 47 / 123 » High-Level Nondeterministic Abstractions in |
110
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
123
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
122
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
ICDCS
2002
IEEE
15 years 6 months ago
2002
IEEE
Just like Remote Procedure Call (RPC) turned out to be a very effective OS abstraction in building client-server applications over LANs, Type-based Publish-SubTPS) can be viewed a...
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...