Sciweavers

4781 search results - page 199 / 957
» Online algorithms for network design
Sort
View
SPAA
2003
ACM
15 years 12 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
IEEEHPCS
2010
15 years 5 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
DAC
2003
ACM
16 years 7 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
CIKM
1999
Springer
15 years 11 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
JSAC
2006
93views more  JSAC 2006»
15 years 6 months ago
Intrusion Detection Routers: Design, Implementation and Evaluation Using an Experimental Testbed
Abstract--In this paper, we present the design, the implementation details, and the evaluation results of an intrusion detection and defense system for distributed denial-of-servic...
Eric Y. K. Chan, H. W. Chan, K. M. Chan, Vivien P....