Sciweavers

699 search results - page 10 / 140
» The method of combinatorial telescoping
Sort
View
IDEAL
2005
Springer
14 years 1 months ago
Designing an Optimal Network Using the Cross-Entropy Method
Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the syste...
Sho Nariai, Kin-Ping Hui, Dirk P. Kroese
DCC
2005
IEEE
14 years 8 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
CPAIOR
2005
Springer
14 years 1 months ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü
COMPSAC
2006
IEEE
14 years 2 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang
ACG
2006
Springer
14 years 2 months ago
Solving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
Ling Zhao, Martin Müller 0003