67 search results - page 12 / 14 » A Theorem on Higher Bruhat Orders |
ICPP
1999
IEEE
14 years 2 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
AI
2004
Springer
13 years 9 months ago
2004
Springer
We describe a logic-based AI architecture based on Brooks' subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
MMMACNS
2005
Springer
14 years 3 months ago
2005
Springer
Making correct access-control decisions is central to security, which in turn requires accounting correctly for the identity, credentials, roles, authority, and privileges of users...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...