255 search results - page 39 / 51 » A new upper bound for the bipartite Ramsey problem |
182
click to vote
CORR
2010
Springer
15 years 6 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...
164
click to vote
AIPS
2008
15 years 8 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
164
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
173
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
272
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...