Sciweavers

717 search results - page 123 / 144
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
AAAI
1996
14 years 11 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe
JMLR
2010
149views more  JMLR 2010»
14 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
BCSHCI
2007
14 years 11 months ago
HCI and creative problem-solving at Lancaster
The Creative Problem-Solving Research Group (CPSRG) at Lancaster University is a collaboration between psychologists and computer scientists conducting research into creativity, p...
Thomas C. Ormerod, Linden J. Ball, Alan J. Dix, Co...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
EVOW
2007
Springer
15 years 3 months ago
Genetic Representations for Evolutionary Minimization of Network Coding Resources
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...