Sciweavers

27 search results - page 2 / 6
» Pragmatics and Open Problems for Inter-schema Constraint The...
Sort
View
RTAS
2008
IEEE
13 years 11 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
DIGRA
2005
Springer
13 years 10 months ago
The Nip and the Bite
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...
Darshana Jayemanne
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
13 years 8 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
CIA
2004
Springer
13 years 10 months ago
Reasoning About Communication - A Practical Approach Based on Empirical Semantics
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...
Felix A. Fischer, Michael Rovatsos
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 1 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...