Sciweavers

32 search results - page 2 / 7
» Memory-Efficient Symbolic Heuristic Search
Sort
View
PROCEDIA
2011
12 years 11 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
LION
2010
Springer
209views Optimization» more  LION 2010»
14 years 1 months ago
Feature Extraction from Optimization Data via DataModeler's Ensemble Symbolic Regression
We demonstrate a means of knowledge discovery through feature extraction that exploits the search history of an optimization run. We regress a symbolic model ensemble from optimiza...
Kalyan Veeramachaneni, Katya Vladislavleva, Una-Ma...
DSN
2009
IEEE
14 years 3 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...
AIPS
2003
13 years 10 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
AIPS
2008
13 years 11 months ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte