Sciweavers

208 search results - page 23 / 42
» Running or gaming
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 3 months ago
Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge
— This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...
Arvind Narayanan, Elaine Shi, Benjamin I. P. Rubin...
ATAL
2004
Springer
15 years 5 months ago
Multi-Agent Simulation of Collaborative Strategies in a Supply Chain
The bullwhip effect is the amplification of the order variability in a supply chain. This phenomenon causes important financial cost due to higher inventory levels and agility r...
Thierry Moyaux, Brahim Chaib-draa, Sophie D'Amours
APLAS
2008
ACM
15 years 1 months ago
The Complexity of Coverage
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majum...
JIIS
2008
104views more  JIIS 2008»
14 years 11 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 3 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl