245 search results - page 35 / 49 » The Iterated Weakest Link |
191
click to vote
RULES
1993
Springer
15 years 10 months ago
1993
Springer
Objects are collected into an object base because of a presumed need for cooperation among them. In classical object bases the cooperation is based on synchronous, preplanned mess...
175
click to vote
ICCSA
2007
Springer
15 years 10 months ago
2007
Springer
Network-on-Chip (NoC) has been proposed as an attractive alternative to traditional dedicated busses in order to achieve modularity and high performance in the future System-on-Chi...
170
click to vote
3DPVT
2004
IEEE
15 years 9 months ago
2004
IEEE
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
146
click to vote
PPSN
2000
Springer
15 years 9 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
171
click to vote
INFOCOM
1995
IEEE
15 years 9 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...