Sciweavers

2008 search results - page 192 / 402
» Computing with Equations
Sort
View
135
Voted
ANOR
2005
80views more  ANOR 2005»
15 years 2 months ago
Entropic Penalties in Finite Games
The main objects here are finite-strategy games in which entropic terms are subtracted from the payoffs. After such subtraction each Nash equilibrium solves an explicit, unconstra...
Sjur Didrik Flåm, E. Cavazzuti
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 2 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
118
Voted
FOCS
2009
IEEE
15 years 9 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
CLUSTER
2000
IEEE
15 years 7 months ago
Multi-Grid Acceleration of a SIMPLE-Based CFD-Code and Aspects of Parallelization
The present study treats the calculation of the continuous phase of a multiphase flow, i.e. the numerical solution of the equations for a turbulent incompressible flow. An exist...
Klaus Bernert, Thomas Frank, Hellfried Schneider, ...
CVPR
2005
IEEE
16 years 4 months ago
Shape from Shading: A Well-Posed Problem?
Shape From Shading is known to be an ill-posed problem. We show in this paper that if we model the problem in a different way than it is usually done, more precisely by taking int...
Emmanuel Prados, Olivier D. Faugeras