316 search results - page 42 / 64 » Expressiveness of graph conditions with variables |
114
click to vote
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
Abstract. The Scheme language report advocates language design as the composition of a small set of orthogonal constructs, instead of a large accumulation of features. In this pape...
RSA
2008
14 years 9 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
PEPM
2007
ACM
15 years 3 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
ECBS
1999
IEEE
15 years 1 months ago
1999
IEEE
Researchers have defined a number of process modeling methods and have developed in-roads to process-centered environments that support process modeling and project control. Howev...