Sciweavers

7106 search results - page 218 / 1422
» Restricted Complexity, General Complexity
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
SIAMCOMP
2012
13 years 6 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
WOSS
2004
ACM
15 years 9 months ago
Design of self-managing dependable systems with UML and fault tolerance patterns
The development of dependable software systems is a costly undertaking. Fault tolerance techniques as well as self-repair capabilities usually result in additional system complexi...
Matthias Tichy, Daniela Schilling, Holger Giese
WSC
1994
15 years 5 months ago
General purpose simulation with stroboscope
Stroboscope is a programming language designed for the simulation of processes common to construction engineering. These processes are very complex and involve many different type...
Julio C. Martínez, Photios G. Ioannou
CCS
2008
ACM
15 years 5 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki