1439 search results - page 133 / 288 » Fast approximation of centrality |
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
ACSAC
2002
IEEE
15 years 5 months ago
2002
IEEE
The blooming e-commerce is demanding better methods to protect online users' privacy, especially the credit card information that is widely used in online shopping. Holding a...
131
click to vote
CP
1999
Springer
15 years 5 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
113
Voted
FC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Distributed anonymous communication networks like Tor depend on volunteers to donate their resources. However, the efforts of Tor volunteers have not grown as fast as th...
93
Voted
JNS
2008
15 years 23 days ago
2008
The theory of monotone dynamical systems has been found very useful in the modeling of some gene, protein, and signaling networks. In monotone systems, every net feedback loop is p...