Sciweavers

5499 search results - page 317 / 1100
» Generalized Rewrite Theories
Sort
View
ATAL
2007
Springer
16 years 1 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
16 years 1 months ago
Agent-environment interaction in a multi-agent system: a formal model
In this paper, we introduce a formal-language model for explicitly formalizing agent-environment interaction in a multiagent systems (MAS) framework: Conversational Grammar System...
Gemma Bel Enguix, Maria Dolores Jiménez-L&o...
LICS
2006
IEEE
16 years 1 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
210
Voted
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
16 years 1 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon
SIGSOFT
2006
ACM
16 years 1 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba