198 search results - page 23 / 40 » Anytime Bounded Rationality |
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
108
click to vote
AI
1999
Springer
14 years 9 months ago
1999
Springer
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
ICFEM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...