Sciweavers

1662 search results - page 92 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
TAMC
2007
Springer
14 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
TRUST
2009
Springer
14 years 3 months ago
Secure VPNs for Trusted Computing Environments
Abstract. Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restr...
Steffen Schulz, Ahmad-Reza Sadeghi
TROB
2002
120views more  TROB 2002»
13 years 8 months ago
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
N. R. Srinivasa Raghavan, Tanmay Waghmare
CCR
2006
122views more  CCR 2006»
13 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
IWDC
2004
Springer
156views Communications» more  IWDC 2004»
14 years 2 months ago
Agent-Based Distributed Intrusion Alert System
Intrusion detection for computer systems is a key problem in today’s networked society. Current distributed intrusion detection systems (IDSs) are not fully distributed as most o...
Arjita Ghosh, Sandip Sen