212 search results - page 35 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. However, these handoffs can potentially incu...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We consider the power control problem in a timeslotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel betwee...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizi...
ALGORITHMICA
1998
13 years 7 months ago
1998
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...