Sciweavers

4940 search results - page 213 / 988
» On the Complexity of Universal Programs
Sort
View
BMCBI
2010
83views more  BMCBI 2010»
15 years 6 months ago
An effective approach for generating a three-Cys2His2 zinc-finger-DNA complex model by docking
Background: Determination of protein-DNA complex structures with both NMR and X-ray crystallography remains challenging in many cases. High Ambiguity-Driven DOCKing (HADDOCK) is a...
Chun-Chi Chou, M. Rajasekaran, Chinpan Chen
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 6 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
EUROGP
2003
Springer
101views Optimization» more  EUROGP 2003»
15 years 11 months ago
An Enhanced Framework for Microprocessor Test-Program Generation
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to ...
Fulvio Corno, Giovanni Squillero
IPPS
2002
IEEE
15 years 11 months ago
Generating Parallel Programs from the Wavefront Design Pattern
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
John Anvik, Steve MacDonald, Duane Szafron, Jonath...
ESOP
2001
Springer
15 years 11 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen