4940 search results - page 167 / 988 » On the Complexity of Universal Programs |
137
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
134
click to vote
ALT
2003
Springer
16 years 1 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
164
click to vote
AIIDE
2006
15 years 6 months ago
2006
This paper presents a scalable approach to crowd simulation that can generate complex and varied simulations by using multiple types of individuals in a crowd. Efficiency is attai...
144
Voted
ENTCS
2008
15 years 5 months ago
2008
This paper gives an overview of results of the project "Beyond Timed Automata" carried out in the Collaborative Research Center AVACS (Automatic Verification and Analysi...
135
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...