7978 search results - page 240 / 1596 » Combining shared-coin algorithms |
126
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
158
click to vote
ICDCIT
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
158
click to vote
EMO
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
176
click to vote
SC
2004
ACM
15 years 10 months ago
2004
ACM
The file-bundle caching problem arises frequently in scientific applications where jobs process several files concurrently. Consider a host system in a data-grid that maintains...
154
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...