4940 search results - page 188 / 988 » On the Complexity of Universal Programs |
190
Voted
POPL
2012
ACM
14 years 1 months ago
2012
ACM
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
141
click to vote
VL
1998
IEEE
15 years 10 months ago
1998
IEEE
A powerful and useful Data-Flow Visual Programming Language (DFVPL) must provide the necessary programming constructs to deal with complex problems. The main purpose of this paper...
160
Voted
PERCOM
2004
ACM
16 years 5 months ago
2004
ACM
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
149
Voted
FOSSACS
2006
Springer
15 years 9 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
178
click to vote
MP
2010
15 years 28 days ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...