2266 search results - page 58 / 454 » Some Solutions to the Ignoring Problem |
133
click to vote
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
123
click to vote
SIAMDM
2010
14 years 8 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
PODC
1996
ACM
15 years 5 months ago
1996
ACM
There is tremendous demand for the ability to be able to electronically buy and sell goods over networks. This field is called electronic commerce, and it has inspired a large var...
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...