Sciweavers

963 search results - page 99 / 193
» On the decomposition of rational functions
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 7 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
SCALESPACE
2005
Springer
14 years 2 months ago
Vortex and Source Particles for Fluid Motion Estimation
In this paper we propose a new motion estimator for image sequences depicting fluid flows. The proposed estimator is based on the Helmholtz decomposition of vector fields. This ...
Anne Cuzol, Étienne Mémin
ATAL
2008
Springer
13 years 11 months ago
Goal generation with relevant and trusted beliefs
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
Célia da Costa Pereira, Andrea Tettamanzi
JCT
2006
100views more  JCT 2006»
13 years 8 months ago
Approximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
Sang-il Oum, Paul D. Seymour