7930 search results - page 676 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
ARCS
2004
Springer
16 years 23 days ago
2004
Springer
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
173
click to vote
INFOCOM
2003
IEEE
16 years 20 days ago
2003
IEEE
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
221
click to vote
SENSYS
2003
ACM
16 years 19 days ago
2003
ACM
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
203
Voted
FPL
2003
Springer
16 years 18 days ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
217
Voted
RTAS
2002
IEEE
16 years 8 days ago
2002
IEEE
Dynamic voltage scaling (DVS) is being increasingly used for power management in embedded systems. Energy is a scarce resource in embedded real-time systems and energy consumption...