903 search results - page 133 / 181 » Non-well-founded trees in categories |
123
click to vote
LCTRTS
2010
Springer
15 years 8 months ago
2010
Springer
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
126
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
113
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
103
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...