4940 search results - page 248 / 988 » On the Complexity of Universal Programs |
192
click to vote
EUROPAR
2004
Springer
15 years 12 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
165
click to vote
MOZ
2004
Springer
15 years 12 months ago
2004
Springer
Strasheela provides a means for the composer to create a symbolic score by formally describing it in a rule-based way. The environment defines a rich music representation for comp...
175
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
170
click to vote
ICPADS
1996
IEEE
15 years 10 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
167
click to vote
SPLC
2008
15 years 8 months ago
2008
In Context-oriented Programming (COP), programs can be partitioned into behavioral variations expressed as sets of partial program definitions. Such layers can be activated and de...