Sciweavers

173 search results - page 18 / 35
» random 1999
Sort
View
AI
1999
Springer
13 years 9 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
RANDOM
1999
Springer
14 years 2 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
RANDOM
1999
Springer
14 years 2 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
ICPPW
1999
IEEE
14 years 2 months ago
Performance Evaluation of Public-Key Certificate Revocation System with Balanced Hash Tree
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
Hiroaki Kikuchi, Kensuke Abe, Shohachiro Nakanishi
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 9 months ago
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
Richard Arratia