Sciweavers

108 search results - page 8 / 22
» Q: A Scenario Description Language for Interactive Agents
Sort
View
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
DEBS
2009
ACM
14 years 2 months ago
Distributed agent environments in the Ambient Event Calculus
We study the development of distributed agent environments as distributed event-based systems specified in the Ambient Event Calculus (AEC). The AEC is a logic-based formalism th...
Stefano Bromuri, Kostas Stathis
JOT
2007
169views more  JOT 2007»
13 years 7 months ago
Translating AUML Diagrams into Maude Specifications: A Formal Verification of Agents Interaction Protocols
Agents Interaction Protocols (AIPs) play a crucial role in multi-agents systems development. They allow specifying sequences of messages between agents. Major proposed protocols s...
Farid Mokhati, Noura Boudiaf, Mourad Badri, Linda ...
CG
2004
Springer
13 years 7 months ago
Multi-channel publishing of interactive multimedia presentations
The ongoing convergence between TV and the Internet leads traditional broadcast companies to publish their content on the Internet. Interactive digital TV platforms, which support...
Steven Van Assche, Filip Hendrickx, Nico Oorts, Lo...