2231 search results - page 364 / 447 » Alternation as a programming paradigm |
168
click to vote
ICALP
1993
Springer
15 years 8 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
147
click to vote
TACS
1994
Springer
15 years 8 months ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
144
click to vote
EDBT
1990
ACM
15 years 8 months ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
180
click to vote
ANTSW
2004
Springer
15 years 8 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
132
Voted
CPAIOR
2006
Springer
15 years 8 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...