Results 1  10
of
23,318
Generating satisfiable problem instances
 In AAAI/IAAI
, 2000
"... A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem generat ..."
Abstract

Cited by 92 (11 self)
 Add to MetaCart
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem
PROBLEM INSTANCE BOOLEAN FORMULA
"... • Evolution is usually depicted by phylogenetic trees; however: 1. evolution is not always treelike (hybridization, horizontal gene transfer,...) 2. there may be many equally good trees; • Phylogenetic networks [2] are more appropriate in these cases; • We focus here on the minimum common supergrap ..."
Abstract
 Add to MetaCart
• Evolution is usually depicted by phylogenetic trees; however: 1. evolution is not always treelike (hybridization, horizontal gene transfer,...) 2. there may be many equally good trees; • Phylogenetic networks [2] are more appropriate in these cases; • We focus here on the minimum common supergraph approach, initiated by Cassens et al. [1] and formalised by Labarre [3];
Restart Schedules for Ensembles of Problem Instances
 In Proceedings of the 22nd Conference on Artificial Intelligence, 12041210. Menlo Park
"... The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on the Las Vegas algorithm’s run length distribution, which in general is not known in advance and may differ across problem ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
instances. We consider the problem of selecting a single restart schedule to use in solving each instance in a set of instances. We present offline algorithms for computing an (approximately) optimal restart schedule given knowledge of each instance’s run length distribution, generalization bounds
Toward an instance theory of automatization
 Psychological Review
, 1988
"... This article presents a theory in which automatization is construed as the acquisition of a domainspecific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur ..."
Abstract

Cited by 647 (38 self)
 Add to MetaCart
This article presents a theory in which automatization is construed as the acquisition of a domainspecific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur
Learning from Evolved Next Release Problem Instances
"... Taking the Next Release Problem (NRP) as a case study, we intend to analyze the relationship between heuristics and the software engineering problem instances. We adopt an evolutionary algorithm to evolve NRP instances that are either hard or easy for the target heuristic (GRASP in this study), to ..."
Abstract
 Add to MetaCart
Taking the Next Release Problem (NRP) as a case study, we intend to analyze the relationship between heuristics and the software engineering problem instances. We adopt an evolutionary algorithm to evolve NRP instances that are either hard or easy for the target heuristic (GRASP in this study
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
, 2004
"... Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of the algorithm employed. The line of reasoning is roughly the following: There exists a set of distinct, possibly overlappi ..."
Abstract
 Add to MetaCart
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of the algorithm employed. The line of reasoning is roughly the following: There exists a set of distinct, possibly
Molecular Computation Of Solutions To Combinatorial Problems
, 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract

Cited by 773 (6 self)
 Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility
Nonlinear component analysis as a kernel eigenvalue problem

, 1996
"... We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all ..."
Abstract

Cited by 1573 (83 self)
 Add to MetaCart
We describe a new method for performing a nonlinear form of Principal Component Analysis. By the use of integral operator kernel functions, we can efficiently compute principal components in highdimensional feature spaces, related to input space by some nonlinear map; for instance the space of all
Results 1  10
of
23,318