Sciweavers

89 search results - page 3 / 18
» Abstraction Heuristics Extended with Counting Abstractions
Sort
View
CP
2000
Springer
14 years 3 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 11 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
CEC
2003
IEEE
14 years 2 months ago
Phylogenetic trees using evolutionary search: initial progress in extending Gaphyl to work with genetic data
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
Clare Bates Congdon, Kevin J. Septor
CADE
2011
Springer
12 years 10 months ago
Extending Sledgehammer with SMT Solvers
Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically s...
Jasmin Christian Blanchette, Sascha Böhme, La...
MOC
2002
90views more  MOC 2002»
13 years 10 months ago
Explicit bounds and heuristics on class numbers in hyperelliptic function fields
Abstract. In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function fiel...
Andreas Stein, Edlyn Teske