Sciweavers

81 search results - page 8 / 17
» Exploring the search space of quantum programs
Sort
View
CP
2007
Springer
14 years 1 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant
ISCI
2008
137views more  ISCI 2008»
13 years 7 months ago
Inference of differential equation models by genetic programming
This paper describes an evolutionary method for identifying a causal model from the observed time series data. We use a system of ordinary differential equations (ODEs) as the cau...
Hitoshi Iba
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
ECML
2006
Springer
13 years 11 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
11 years 10 months ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...