Sciweavers

12 search results - page 2 / 3
» On Termination of Binary CLP Programs
Sort
View
TPHOL
2003
IEEE
13 years 10 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
GECCO
2007
Springer
283views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolving Lucene search queries for text classification
We describe a method for generating accurate, compact, human understandable text classifiers. Text datasets are indexed using Apache Lucene and Genetic Programs are used to constr...
Laurence Hirsch, Robin Hirsch, Masoud Saeedi
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 5 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
IPL
2010
114views more  IPL 2010»
13 years 3 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
CCS
2010
ACM
13 years 5 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...