Results 1  10
of
109,751
Boosting combinatorial search through randomization
, 1998
"... Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of “heavytailed cost distributions”, meaning that at any time during the experiment there is a nonnegligible probability of hitting a problem that requires exponentially more time to solve t ..."
Abstract

Cited by 359 (34 self)
 Add to MetaCart
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of “heavytailed cost distributions”, meaning that at any time during the experiment there is a nonnegligible probability of hitting a problem that requires exponentially more time to solve
Algebras for combinatorial search
 In Workshop on Mathematically Structured Functional Programming
, 2006
"... We show how combinatorial search strategies including depthfirst, breadthfirst and depthbounded search can be viewed as different implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting that ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We show how combinatorial search strategies including depthfirst, breadthfirst and depthbounded search can be viewed as different implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting
Statistical mechanics of combinatorial search
 In Proc. of the Workshop on Physics and Computation (PhysComp94
, 1994
"... The statistical mechanics of combinatorial search problems is described using the example of the wellknown NPcomplete graph coloring problem. We focus on a recently identified phase transition from under to overconstrained problems, near which are concentrated many hard to solve search problems. ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
The statistical mechanics of combinatorial search problems is described using the example of the wellknown NPcomplete graph coloring problem. We focus on a recently identified phase transition from under to overconstrained problems, near which are concentrated many hard to solve search problems
Algebras for combinatorial search
 In Workshop on Mathematically Structured Functional Programming
, 2006
"... We show how combinatorial search strategies including depthfirst, breadthfirst and depthbounded search can be viewed as di#erent implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting th ..."
Abstract
 Add to MetaCart
We show how combinatorial search strategies including depthfirst, breadthfirst and depthbounded search can be viewed as di#erent implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting
HeavyTailed Distributions in Combinatorial Search
, 1997
"... Combinatorial search methods often exhibit a large variability in performance. We study the cost profiles of combinatorial search procedures. Our study reveals some intriguing properties of such cost profiles. The distributions are often characterized by very long tails or "heavy tails". W ..."
Abstract

Cited by 76 (14 self)
 Add to MetaCart
Combinatorial search methods often exhibit a large variability in performance. We study the cost profiles of combinatorial search procedures. Our study reveals some intriguing properties of such cost profiles. The distributions are often characterized by very long tails or "heavy tails
ARTICLES Combinatorial search of thermoelastic
, 2006
"... shapememory alloys with extremely small hysteresis width ..."
Parallelizing Combinatorial Search in Shared Memory
"... The Langford’s problem is a typical hard combinatorial problem. The last open instance to be solved took one week CPU time on a pool of 3 PCs with a quite specific search algorithm in 2002. It represents a real challenging problem especially for Parallel Combinatorial Search. The paper presents a ge ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The Langford’s problem is a typical hard combinatorial problem. The last open instance to be solved took one week CPU time on a pool of 3 PCs with a quite specific search algorithm in 2002. It represents a real challenging problem especially for Parallel Combinatorial Search. The paper presents a
On the Power of Additive Combinatorial Search Model
 in Proceedings of the 4th Annual International Computing and Combinatorics Conference, Lecture Notes in Comput. Sci. 1449
, 1998
"... We consider two generic problems of combinatorial search under the additive model. The first one is the problem of reconstructing boundedweight vectors. We establish an optimal upper bound and observe that it unifies many known results for coinweighing problems. The developed technique provides a ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We consider two generic problems of combinatorial search under the additive model. The first one is the problem of reconstructing boundedweight vectors. We establish an optimal upper bound and observe that it unifies many known results for coinweighing problems. The developed technique provides a
The Advantages of Multiple Parallelizations in Combinatorial Search
, 1994
"... Applications typically have several potential sources of parallelism, and in choosing a particular parallelization, the programmer must balance the benefits of each source of parallelism with the corresponding overhead. The tradeoffs are often difficult to analyze, as they may depend on the hardwar ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
nodes. We explore the complexity of the tradeoffs involved in this decision by considering alternative parallelizations of combinatorial search, examining the factors that determine the bestperforming implementation for this important class of problems. Using subgraph isomorphism as a representative
Three halving conjectures in combinatorial search
, 2014
"... The goal of this note is to pose 3 interesting conjectures in combinatorial search theory. In combinatorial search theory our goal is to find one or more unknown elements from a given set using as few of certain allowed queries as possible. Here we are interested in the socalled adaptive model wher ..."
Abstract
 Add to MetaCart
The goal of this note is to pose 3 interesting conjectures in combinatorial search theory. In combinatorial search theory our goal is to find one or more unknown elements from a given set using as few of certain allowed queries as possible. Here we are interested in the socalled adaptive model
Results 1  10
of
109,751