Sciweavers

249 search results - page 25 / 50
» A Monotonicity Principle for Information Theory
Sort
View
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 11 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 4 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
FLAIRS
2008
13 years 11 months ago
Second-Order Risk Constraints
This paper discusses how numerically imprecise information can be modelled and how a risk evaluation process can be elaborated by integrating procedures for numerically imprecise ...
Love Ekenberg, Aron Larsson, Mats Danielson
COCOON
2009
Springer
14 years 3 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...
SDB
1995
178views Database» more  SDB 1995»
14 years 17 days ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin