15033 search results - page 2590 / 3007 » Complexity Theory and Algorithms |
201
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
189
click to vote
AAAI
2010
15 years 7 months ago
2010
Developing a robust, flexible, closed-loop walking algorithm for a humanoid robot is a challenging task due to the complex dynamics of the general biped walk. Common analytical ap...
183
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
340
click to vote
AICCSA
2008
IEEE
15 years 7 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
200
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...