Sciweavers

198 search results - page 13 / 40
» Anytime Bounded Rationality
Sort
View
92
Voted
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 24 days ago
Construction of Rational Surfaces Yielding Good Codes
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
Alain Couvreur
104
Voted
JCT
2010
81views more  JCT 2010»
14 years 11 months ago
On the probability of a rational outcome for generalized social welfare functions on three alternatives
In [11], Kalai investigated the probability of a rational outcome for a generalized social welfare function (GSWF) on three alternatives, when the individual preferences are unifo...
Nathan Keller
AAAI
2010
15 years 27 days ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
107
Voted
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
14 years 11 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
104
Voted
CP
2007
Springer
15 years 6 months ago
Bound-Consistent Deviation Constraint
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Pierre Schaus, Yves Deville, Pierre Dupont