This paper presents a distributed, market-based approach for providing multiple service classes with graded quality-of-service (QoS) characteristics in the context of supporting ABR traac in ATM networks. We deene a network model facilitating two types of network traac, reserved and non-reserved, the latter servicing traac sources with non-strict QoS requirements on a best-eeort basis. Two goal...

Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such games, contributions to the public good are made only by cooperators, while all players, including defectors, reap public goods benefits, which are sha...

Treemodels are valuable tools for predictivemodeling and datamining. Traditional tree-growingmethodologies such as CART are known to suffer from problems including greediness, instability, and bias in split rule selection. Alternative tree methods, including Bayesian CART (Chipman et al., 1998; Denison et al., 1998), random forests (Breiman, 2001a), bootstrap bumping (Tibshirani and Knight, 199...

The purpose of this paper is to understand greedily solvable linear programs in a geometric way. Such linear programs have recently been considered by Queyranne, Spieksma and Tardella, Faigle and Kern, and Krüger for antichains of posets, and by Frank for a class of lattice polyhedra, and by Kashiwabara and Okamoto for extreme points of abstract convex geometries. Our guiding principle is that ...

Anytime variants of Dijkstra’s and A* shortest path algorithms quickly produce a suboptimal solution and then improve it over time. For example, ARA* introduces a weighting value (ε) to rapidly find an initial suboptimal path and then reduces ε to improve path quality over time. In ARA*, ε is based on a linear trajectory with ad-hoc parameters chosen by each user. We propose a new Anytime A* al...

The construction of efficient and effective decision trees remains a key topic in machine learning because of their simplicity and flexibility. A lot of heuristic algorithms have been proposed to construct near-optimal decision trees. Most of them, however, are greedy algorithms which have the drawback of obtaining only local optimums. Besides, common split criteria, e.g. Shannon entropy, Gain ...

Bayesian Reinforcement Learning (RL) is capable of not only incorporating domain knowledge, but also solving the explorationexploitation dilemma in a natural way. As Bayesian RL is intractable except for special cases, previous work has proposed several approximation methods. However, these methods are usually too sensitive to parameter values, and finding an acceptable parameter setting is pra...

The Image of an Attorney as Illustrated in Works Polish Poets and Political Writers the 16th–17th Centuries article presents image attorney characterized Old literature 16th 17th centuries. It reflected, to some extent, attitude people time (primarily nobility) towards legal profession. There is no doubt that society’s perception attorneys was unequivocally negative. They were portrayed greedy,...

We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computational individuals, virtually organized in colonies, and ruled by a leader (broker) who is elected or imposed by system administrators. Every individual asks the broker to log in the colony by declaring the resources that can be of...

In this paper, we present the results of both classroom lessons and Web-based learning for Japanese manual alphabets (YUBIMOJI) to ordinary elementary school children. So far, we have developed an easy-to-use edutainment system: Practice! YUBIMOJI AIUEO (PYA). The objectives of PYA are to promote basic expressions of Kana characters (AIUEO) of Japanese manual alphabets, and to give the experien...