17018 search results - page 3129 / 3404 » From the How to the What |
180
click to vote
NAS
2010
IEEE
15 years 5 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
182
click to vote
NOMS
2010
IEEE
15 years 5 months ago
2010
IEEE
—Popular web services and applications such as Google Apps, DropBox, and Go.Pc introduce a wasteful imbalance of processing resources. Each host operated by a provider serves hun...
144
click to vote
PVLDB
2010
15 years 5 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
185
click to vote
RCIS
2010
15 years 5 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
198
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...