4526 search results - page 351 / 906 » Algorithmic problems related to the Internet |
171
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
183
click to vote
EMO
2006
Springer
15 years 10 months ago
2006
Springer
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
206
Voted
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
167
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
186
click to vote
ICOIN
2001
Springer
15 years 11 months ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...