5904 search results - page 1137 / 1181 » Requirements for a Composition Language |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving s...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...