3946 search results - page 401 / 790 » The computational complexity of choice sets |
195
click to vote
MP
2008
15 years 7 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
146
click to vote
ICCS
2007
Springer
16 years 1 months ago
2007
Springer
New insights have been gained recently into the interplay between complex network architectures and the collective dynamics of simple elements coupled through them. The usual parad...
219
click to vote
ATAL
2005
Springer
16 years 1 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
177
click to vote
SAS
2001
Springer
16 years 1 days ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
184
click to vote
DLT
2003
15 years 9 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...