256 search results - page 40 / 52 » A New Synchronous Lower Bound for Set Agreement |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
VLDB
1997
ACM
13 years 12 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
AIPS
2006
13 years 9 months ago
2006
Policy Reuse is a method to improve reinforcement learning with the ability to solve multiple tasks by building upon past problem solving experience, as accumulated in a Policy Li...
CONCUR
1999
Springer
14 years 1 days ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
TASLP
2011
13 years 2 months ago
2011
—This paper presents a novel student model intended to automate word-list-based reading assessments in a classroom setting, specifically for a student population that includes b...