Sciweavers

336 search results - page 22 / 68
» Approximating Transitivity in Directed Networks
Sort
View
HIPC
2007
Springer
14 years 2 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CIS
2005
Springer
14 years 4 months ago
Survivability Computation of Networked Information Systems
Abstract. Survivability should be considered beyond security for networked information systems, which emphasizes the ability of continuing providing services timely in malicious en...
Xuegang Lin, Rongsheng Xu, Miaoliang Zhu
GLOBECOM
2007
IEEE
14 years 2 months ago
Delay and Energy Tradeoff in Multi-State Wireless Sensor Networks
This paper discusses a first attempt to investigate, using analytic means, the transmission delay and energy characteristics of a multi-state wireless sensor network. For such a ne...
Woei Ling Leow, Hossein Pishro-Nik
EOR
2006
78views more  EOR 2006»
13 years 11 months ago
A multi-objective resource allocation problem in PERT networks
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each ac...
Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Ko...
ACSAC
2007
IEEE
14 years 5 months ago
Tracking Darkports for Network Defense
We exploit for defensive purposes the concept of darkports – the unused ports on active systems. We are particularly interested in such ports which transition to become active (...
David Whyte, Paul C. van Oorschot, Evangelos Krana...