4940 search results - page 147 / 988 » On the Complexity of Universal Programs |
218
click to vote
JMLC
2000
Springer
15 years 8 months ago
2000
Springer
The principle of modularisation is one of the main techniques that software designers use to tame the complexity of programming. A software project, however, is complex in many oth...
152
click to vote
COMPLEXITY
2007
15 years 4 months ago
2007
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
123
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
126
click to vote
CSCLP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
137
click to vote
CC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...