1297 search results - page 178 / 260 » Dynamic Object Process Graphs |
132
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
144
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
Online auction Web sites are fast changing, highly dynamic, and complex as they involve tremendous sellers and potential buyers, as well as a huge amount of items listed for biddi...
138
click to vote
NSDI
2007
15 years 7 months ago
2007
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
166
Voted
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
136
click to vote
CASCON
1996
15 years 6 months ago
1996
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...