1480 search results - page 172 / 296 » Distributed algorithms for weighted problems in sparse graph... |
116
click to vote
PDPTA
2000
15 years 2 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
111
Voted
ICDCS
1996
IEEE
15 years 4 months ago
1996
IEEE
In a distributed environment where nodes are independently motivated, many transactions or commercial exchanges may be stymied due to a lack of trust between the participants. The...
114
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
140
Voted
WCE
2007
15 years 1 months ago
2007
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
112
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...