7930 search results - page 73 / 1586 » Greedy in Approximation Algorithms |
170
click to vote
NECO
2008
15 years 6 months ago
2008
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
167
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
121
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedback. Given an estimation of future transmission resources an...
182
click to vote
IPPS
2009
IEEE
16 years 24 days ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
144
click to vote
CDC
2008
IEEE
16 years 19 days ago
2008
IEEE
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...