Sciweavers

CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 4 months ago
Popularity, Novelty and Attention
We analyze the role that popularity and novelty play in attracting the attention of users to dynamic websites. We do so by determining the performance of three different strategie...
Fang Wu, Bernardo A. Huberman
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 4 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 4 months ago
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
Jeroen Ketema, Jakob Grue Simonsen
AEI
2007
102views more  AEI 2007»
13 years 4 months ago
Incremental development of CBR strategies for computing project cost probabilities
This paper presents three CBR systems that have been developed over seven years in collaboration with two industrial partners. In this research, case based reasoning (CBR) is used...
Benny Raphael, Bernd Domer, Sandro Saitta, Ian F. ...
ICML
2010
IEEE
13 years 5 months ago
On learning with kernels for unordered pairs
We propose and analyze two strategies to learn over unordered pairs with kernels, and provide a common theoretical framework to compare them. The strategies are related to methods...
Martial Hue, Jean-Philippe Vert
ATAL
2010
Springer
13 years 5 months ago
Strategic planning for probabilistic games with incomplete information
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
Henning Schnoor
PSTV
1992
113views Hardware» more  PSTV 1992»
13 years 5 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...
AAAI
1996
13 years 5 months ago
Learning to Take Actions
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
Roni Khardon
ICMAS
1998
13 years 5 months ago
Determining Successful Negotiation Strategies: An Evolutionary Approach
To be successful in open, multi-agent environments, autonomous agents must be capable of adapting their negotiation strategies and tactics to their prevailing circumstances. To th...
Noyda Matos, Carles Sierra, Nicholas R. Jennings
ATAL
2008
Springer
13 years 6 months ago
Programming agents as a means of capturing self-strategy
In this paper we report results of an extensive evaluation of people's ability to reproduce the strategies they use in simple real-life settings. Having the ability to reliab...
Michal Chalamish, David Sarne, Sarit Kraus