1486 search results - page 129 / 298 » Algorithms for two-box covering |
FOSSACS
2010
Springer
15 years 11 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
159
click to vote
JACM
2006
15 years 4 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
151
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
118
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evolutionary computation is used to construct undetectable computer attack scripts. Using a simulated operating system, we show that scripts can be evolved to cover their tracks a...
121
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
— This paper introduces the concept of kl-feasible cuts, by controlling both the number k of inputs and the number l of outputs in a circuit cut. To provide scalability, the conc...