Sciweavers

830 search results - page 81 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
MOBIHOC
2006
ACM
16 years 4 months ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
Juan Liu, Ying Zhang, Feng Zhao
ICNP
1998
IEEE
15 years 8 months ago
A Class of End-to-End Congestion Control Algorithms for the Internet
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
S. Jamaloddin Golestani, S. Bhattacharyya
RAID
1999
Springer
15 years 8 months ago
Towards trapping wily intruders in the large
The rapid increase in network bandwidth from mega bits per second to giga bits per second and potentially to tera bits per second, is making it increasingly difficult to carry out...
Glenn Mansfield
NN
2006
Springer
114views Neural Networks» more  NN 2006»
15 years 4 months ago
Modular learning models in forecasting natural phenomena
Modular model is a particular type of committee machine and is comprised of a set of specialized (local) models each of which is responsible for a particular region of the input s...
Dimitri P. Solomatine, Michael Baskara L. A. Siek
COR
2008
97views more  COR 2008»
15 years 4 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...