4451 search results - page 41 / 891 » On Random Ordering Constraints |
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
124
click to vote
IJCNN
2006
IEEE
15 years 5 months ago
2006
IEEE
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
130
click to vote
CADE
2005
Springer
16 years 3 days ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
CIE
2009
Springer
15 years 6 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
100
click to vote
CAV
2009
Springer
16 years 10 days ago
2009
Springer
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...