1090 search results - page 190 / 218 » Priority Algorithms for Graph Optimization Problems |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the w...
CASES
2004
ACM
13 years 11 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...