Sciweavers

3820 search results - page 606 / 764
» Bounded Model Debugging
Sort
View
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
15 years 6 months ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
APBC
2008
231views Bioinformatics» more  APBC 2008»
15 years 4 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...
SIROCCO
2008
15 years 3 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
15 years 2 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
BMCBI
2005
116views more  BMCBI 2005»
15 years 2 months ago
SuperLigands - a database of ligand structures derived from the Protein Data Bank
Background: Currently, the PDB contains approximately 29,000 protein structures comprising over 70,000 experimentally determined three-dimensional structures of over 5,000 differe...
Elke Michalsky, Mathias Dunkel, Andrean Goede, Rob...