9949 search results - page 209 / 1990 » On the Network Complexity of Selection |
189
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
163
click to vote
NETWORKS
2010
15 years 5 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
202
click to vote
GLOBECOM
2007
IEEE
16 years 28 days ago
2007
IEEE
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
178
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
186
click to vote
INFOCOM
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract— Simulation has been the dominant research methodology in wireless and sensor networking. When mobility is added, real-world experimentation is especially rare. However,...