2714 search results - page 350 / 543 » Approximation Schemes for Scheduling |
137
Voted
AAAI
2012
13 years 6 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
139
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
142
Voted
BROADNETS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute th...
123
Voted
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The exploitation of multiuser diversity and the application of multiple antennas at transmitter and receiver are considered to be key technologies for future highly bandwidtheff...
142
click to vote
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
Epidemic routing has been proposed as a robust transmission scheme for sparse mobile ad hoc networks. Under the assumption of no contention, epidemic routing has the minimum end-t...