345 search results - page 37 / 69 » Computer-Assisted Simulation Proofs |
102
click to vote
COLT
2005
Springer
15 years 8 months ago
2005
Springer
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
108
click to vote
TABLEAUX
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
112
click to vote
DALT
2004
Springer
15 years 7 months ago
2004
Springer
Declarative modelling approaches in principle assume a notion of representation or representational content for the modelling concepts. The notion of representational content as di...
CONCUR
2003
Springer
15 years 7 months ago
2003
Springer
traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge A fully abstract denotational semantics for the ...
107
click to vote
PRDC
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent ...