Sciweavers

1332 search results - page 34 / 267
» Combinatorial Algorithms
Sort
View
QSIC
2003
IEEE
14 years 2 months ago
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
Christine Cheng, Adrian Dumitrescu, Patrick J. Sch...
TALG
2008
115views more  TALG 2008»
13 years 9 months ago
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki...
IAT
2007
IEEE
14 years 3 months ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
14 years 5 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...
ANOR
2004
116views more  ANOR 2004»
13 years 9 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys