48 search results - page 1 / 10 » Greedy by Choice |
PODS
1992
ACM
13 years 9 months ago
1992
ACM
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
TAMC
2009
Springer
14 years 4 days ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...