Sciweavers

1963 search results - page 385 / 393
» The Maximum Solution Problem on Graphs
Sort
View
BROADNETS
2007
IEEE
14 years 2 months ago
Fair bandwidth allocation framework for heterogeneous multi-radio Wireless Mesh Networks
Abstract—To reap the benefits of advances in wireless technologies as well as provide backward compatibility with current investments, future wireless routers that constitute th...
Shree Raman, Aura Ganz, Ramgopal R. Mettu
FP
1992
135views Formal Methods» more  FP 1992»
14 years 20 days ago
High Level Specification of I/O in Functional Languages
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
Peter Achten, John H. G. van Groningen, Marinus J....
EURONGI
2008
Springer
13 years 10 months ago
Interference-Aware Channel Assignment in Wireless Mesh Networks
DED ABSTRACT The increased popularity and the growth in the number of deployed IEEE 802.11 Access Points (APs) have raised the opportunity to merge together various disjointed wire...
Rosario Giuseppe Garroppo, Stefano Giordano, David...
SPAA
2009
ACM
14 years 9 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 8 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...