Sciweavers

4850 search results - page 957 / 970
» Proof and Computation in Geometry
Sort
View
ATAL
2000
Springer
15 years 3 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 3 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
COLT
1999
Springer
15 years 3 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
AUSAI
1998
Springer
15 years 2 months ago
A Formal Embedding of AgentSpeak(L) in 3APL
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
PLDI
1997
ACM
15 years 2 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen