Sciweavers

6881 search results - page 1044 / 1377
» Motivation
Sort
View
ACG
2009
Springer
16 years 1 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
16 years 1 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
AI
2009
Springer
16 years 1 months ago
Opinion Learning without Emotional Words
This paper shows that a detailed, although non-emotional, description of event or an action can be a reliable source for learning opinions. Empirical results show the practical uti...
Marina Sokolova, Guy Lapalme
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
16 years 1 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
170
Voted
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 1 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
« Prev « First page 1044 / 1377 Last » Next »