We examine adaptive strategies adopted by vehicles for route selection en-route in transportation networks. By studying a model of two-dimensional cellular automata, we characterized parameter called path-greediness, which corresponds to the tendency them travel their destinations via shortest path. The path-greediness each individual vehicle is updated based on local traffic conditions, either...

Based on our analysis and experiments using real-world datasets, we find that the greediness of forward feature selection algorithms does not severely corrupt the accuracy of function approximation using the selected input features, but improves the efficiency significantly. Hence, we propose three greedier algorithms in order to further enhance the efficiency of the feature selection processin...

The purpose of this paper is to present examples for the sometimes surprisingly di/erent behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems. c © 2003 Elsevier B.V. All rights reserved.

Rosenthal (1973) introduced the class of congestion games and proved that they always possess a Nash equilibrium in pure strategies. Fotakis et al. (2005) introduce the notion of a greedy strategy tuple, where players sequentially and irrevocably choose a strategy that is a best response to the choice of strategies by former players. Whereas the former solution concept is driven by strong assum...

A greedy personality is usually accompanied by arrogance and confidence. This work investigates the cooperation success condition in context of biased payoff allocation self-confidence. The first component allows organizer a spatial public goods game to receive different proportion than other participants. second aspect influences micro-level dynamics strategy updates, wherein players can maint...

Dedicated to that mysterious Power: Who requires odd holes for imperfection in graphs And ensures unimodularity of network flows Who converges large numbers towards normality And lets greediness work for the spanning tree Who animates the intelligence inside us And creates the world-illusion around us She is the seed of all creativity And without Her grace This work would forever remain a mere ...

Brams and Taylor (1994) presented a version of the Divide-the-dollar game (DD), which they call DD1. DD1 suffers from the following drawback: when each player demands approximately the entire dollar, then if the least greedy player is unique, then this player obtains approximately the entire dollar even if he is only slightly less greedy than the other players. I introduce a parametrized family...

We implemented Asynchronous Deep Q-learning to learn the Atari 2600 game Breakout with RAM inputs. We tested the performance of the our agent by varying network structure, training policy, and environment settings. We saw the he most notable improvement through changing the environment settings. Furthermore, we observed interesting training effects when we used a Boltzmann-Q Policy that encoura...

Compiler writers continue to search for ways to use the ever-increasing number of parallel functional units in modern microarchitectures. The most popular approach today is to build a tracebased instruction scheduler, since they are effective and can be conceptually simple to implement. DAG-based schedulers that look along multiple control paths, instead of along just one as in a trace-based sc...

In evolutionary computation ‘learning’ is a byproduct of the evolutionary process as successful individuals are retained through stochastic trial and error. This learning process can be rather slow, due to the weak strategy used to guide evolution. A way to overcome this drawback is to incorporate greedy operators in the evolutionary process. This paper investigates the effectiveness of this ap...