Sciweavers

2657 search results - page 145 / 532
» On the complexity of hierarchical problem solving
Sort
View
NIPS
1997
15 years 3 months ago
Reinforcement Learning with Hierarchies of Machines
We present a new approach to reinforcement learning in which the policies considered by the learning process are constrained by hierarchies of partially specified machines. This ...
Ronald Parr, Stuart J. Russell
AUTOMATICA
2007
102views more  AUTOMATICA 2007»
15 years 1 months ago
An extension of duality to a game-theoretic framework
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
Lacra Pavel
BMCBI
2010
156views more  BMCBI 2010»
15 years 1 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...
ICALP
2007
Springer
15 years 7 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ICECCS
1995
IEEE
100views Hardware» more  ICECCS 1995»
15 years 5 months ago
POSD-a notation for presenting complex systems of processes
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...
Peter Henderson, Graham D. Pratten