3218 search results - page 348 / 644 » Timed Extensions for SDL |
178
click to vote
AAAI
2010
15 years 8 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
197
click to vote
ICWS
2008
IEEE
15 years 8 months ago
2008
IEEE
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
170
click to vote
PLANX
2008
15 years 8 months ago
2008
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
171
click to vote
ACSW
2004
15 years 8 months ago
2004
Business processes are often likely to undergo drastic changes and hence the workflow systems that model, simulate and enact these processes should support the monitoring and cont...
182
click to vote
DLT
2006
15 years 8 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...