2464 search results - page 155 / 493 » Efficient learning equilibrium |
ICGI
2000
Springer
14 years 1 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
UAI
2008
13 years 11 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
NIPS
2001
13 years 11 months ago
2001
In packet switches, packets queue at switch inputs and contend for outputs. The contention arbitration policy directly affects switch performance. The best policy depends on the c...
UAI
1998
13 years 11 months ago
1998
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...
IJMC
2006
13 years 9 months ago
2006
: M-learning is a rapidly expanding recently domain. Provoked by the fast advances of mobile technologies different applications and systems are developed continuously. Here we add...