570 search results - page 54 / 114 » A Connectivity Constraint Using Bridges |
CADE
2007
Springer
14 years 10 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
MDM
2001
Springer
14 years 2 months ago
2001
Springer
In an ad-hoc mobile network architecture, all the mobile hosts (MHs) are connected with each other through a wireless network that has a frequently changing topology. This type of ...
CDC
2009
IEEE
13 years 7 months ago
2009
IEEE
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
OTM
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...