674 search results - page 82 / 135 » The computational complexity of the parallel knock-out probl... |
165
click to vote
IPPS
2009
IEEE
16 years 23 days ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
175
click to vote
MIDDLEWARE
2009
Springer
16 years 20 days ago
2009
Springer
The innate dynamicity and complexity of mobile ad-hoc networks (MANETs) has resulted in numerous ad-hoc routing protocols being proposed. Furthermore, numerous variants and hybrids...
170
Voted
IPPS
2007
IEEE
16 years 12 days ago
2007
IEEE
In today’s large and complex network scenario vulnerability scanners play a major role from security perspective by proactively identifying the known security problems or vulner...
154
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
151
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...