1455 search results - page 279 / 291 » Optimal Location Management Algorithms for Mobile Networks |
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
IJNSEC
2007
13 years 7 months ago
2007
Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless networ...
CCO
2001
Springer
14 years 1 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
MOBIDE
2006
ACM
14 years 1 months ago
2006
ACM
Mobile and pervasive applications frequently rely on devices such as RFID antennas or sensors (light, temperature, motion) to provide them information about the physical world. Th...