1020 search results - page 190 / 204 » Efficiency of Search Methods in Dynamic Wireless Networks |
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
EUROPAR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Internet traffic is bursty and network servers are often overloaded with surprising events or abnormal client request patterns. This paper studies scheduling algorithms for in...