Sciweavers

7393 search results - page 1010 / 1479
» Synthesis-for-testability using transformations
Sort
View
150
Voted
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 11 months 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
PET
2005
Springer
15 years 10 months ago
Anonymity Preserving Techniques in Trust Negotiations
Trust negotiation between two subjects require each one proving its properties to the other. Each subject specifies disclosure policies stating the types of credentials and attrib...
Indrakshi Ray, Elisa Bertino, Anna Cinzia Squiccia...
144
Voted
ATAL
2005
Springer
15 years 10 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
157
Voted
CP
2004
Springer
15 years 10 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
EUROCRYPT
2004
Springer
15 years 10 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
« Prev « First page 1010 / 1479 Last » Next »