48 search results - page 8 / 10 » Probabilistically Checkable Proofs and Applications |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
ASIAN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...