4451 search results - page 321 / 891 » On Random Ordering Constraints |
217
click to vote
ICTAI
2009
IEEE
15 years 4 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...
155
click to vote
RSA
2010
15 years 5 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
196
click to vote
ECAL
2007
Springer
16 years 27 days ago
2007
Springer
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
194
click to vote
COMAD
2008
15 years 8 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
170
click to vote
ISCA
2007
IEEE
16 years 1 months ago
2007
IEEE
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...