3228 search results - page 348 / 646 » Computationally Sound Proofs |
125
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a computationally efficient method for deriving coordinate representations for the equations of motion and the affine connection describing a class of Lagrangi...
138
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
129
click to vote
KI
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
154
click to vote
COLLABORATION
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent ...
124
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...