Sciweavers

3946 search results - page 176 / 790
» The computational complexity of choice sets
Sort
View
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
16 years 4 days ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
AIIDE
2007
15 years 9 months ago
A Demonstration of ScriptEase Motivational Ambient and Latent Behaviors for Computer RPGs
This demonstration describes the generation of ambient and latent NPC behavior scripts using generative behavior patterns with ScriptEase. Our behavior model supports behavior rol...
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer,...
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 8 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
JLP
2011
155views more  JLP 2011»
15 years 1 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
DSVIS
2008
Springer
15 years 8 months ago
A Model-Based Approach to Supporting Configuration in Ubiquitous Systems
This paper presents an approach for representing, and providing computer support for, the configuration of interactive systems, particularly ubiquitous systems, that offers a flexi...
Tony McBryan, Philip D. Gray