Sciweavers

LICS
1997
IEEE
13 years 8 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
EPIA
1993
Springer
13 years 8 months ago
A Uniform Framework for Deductive Database Derivation Strategies
A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a ge...
Robert Demolombe
CCS
2001
ACM
13 years 9 months ago
Interoperable strategies in automated trust negotiation
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
Ting Yu, Marianne Winslett, Kent E. Seamons
SC
2003
ACM
13 years 9 months ago
Optimizing Reduction Computations In a Distributed Environment
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
Tahsin M. Kurç, Feng Lee, Gagan Agrawal, &U...
ITS
2004
Springer
138views Multimedia» more  ITS 2004»
13 years 10 months ago
A Metacognitive ACT-R Model of Students' Learning Strategies in Intelligent Tutoring Systems
Research has shown that students’ problem-solving actions vary in type and duration. Among other causes, this behavior is a result of strategies that are driven by different goal...
Ido Roll, Ryan Shaun Baker, Vincent Aleven, Kennet...
ATAL
2004
Springer
13 years 10 months ago
The Utility of Adaptation vs. Signaling Action Tendencies in the Competition for Resources
We explore strategies to resolve conflicts in multiagent environments that arise when agents compete for resources they need for survival and procreation. As expected, social str...
Matthias Scheutz
ATAL
2004
Springer
13 years 10 months ago
The Advantages of Compromising in Coalition Formation with Incomplete Information
This paper presents protocols and strategies for coalition formation with incomplete information under time constraints. It focuses on strategies for coalition members to distribu...
Sarit Kraus, Onn Shehory, Gilad Taase
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
13 years 10 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
TARK
2005
Springer
13 years 10 months ago
Understanding human strategies for change: an empirical study
The ability to model changes in preferences is crucially important for sound decision making and effective communication. Much has been written about strategies for changing belie...
Alankar Karol, Mary-Anne Williams
ICRA
2005
IEEE
120views Robotics» more  ICRA 2005»
13 years 10 months ago
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...
David Hsu, Gildardo Sánchez-Ante, Zheng Sun