Sciweavers

8695 search results - page 409 / 1739
» Making the Complex Simple
Sort
View
EJC
2000
15 years 9 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
AAAI
1996
15 years 9 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
ATMN
1996
15 years 9 months ago
Study of multiplexing for group-based quality of service delivery
In this work, the problem of scheduling packets with a group as opposed to an individual deadline is considered. Packets of the same group are supposed to belong in the same appli...
Xin Wang, Ioannis Stavrakakis
NIPS
1994
15 years 9 months ago
Finding Structure in Reinforcement Learning
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
Sebastian Thrun, Anton Schwartz
BMCBI
2010
96views more  BMCBI 2010»
15 years 7 months ago
The Protein-DNA Interface database
The Protein-DNA Interface database (PDIdb) is a repository containing relevant structural information of Protein-DNA complexes solved by X-ray crystallography and available at the...
Tomás Norambuena, Francisco Melo