3395 search results - page 286 / 679 » Learning to efficiently rank |
191
click to vote
UAI
2008
15 years 8 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...
139
click to vote
NIPS
2001
15 years 8 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...
141
click to vote
UAI
1998
15 years 8 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...
174
click to vote
IJMC
2006
15 years 6 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...
156
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using othe...