4940 search results - page 729 / 988 » On the Complexity of Universal Programs |
192
click to vote
CALCO
2005
Springer
16 years 3 days ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
208
click to vote
CMMR
2005
Springer
16 years 2 days ago
2005
Springer
The pureCMusic (pCM++) framework gives the possibility to write a piece of music in terms of an algorithmic-composition-based program -also controlled by data streaming from extern...
164
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
156
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
167
click to vote
HPCC
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. The Ubiquitous Web requires novel programming paradigms and distributed architectures for the support of advanced services to a multitude of user devices and profiles. I...