Sciweavers

1127 search results - page 94 / 226
» Theory Extension in ACL2(r)
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
16 years 9 days ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
AC
2000
Springer
15 years 10 months ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
TAPSOFT
1997
Springer
15 years 10 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 8 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
ASC
2008
15 years 6 months ago
Morphic computing
Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation tha...
Germano Resconi, Masoud Nikravesh