Sciweavers

1686 search results - page 94 / 338
» Programs as polygraphs: computability and complexity
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 10 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
ICLP
2004
Springer
15 years 3 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
ISQED
2005
IEEE
140views Hardware» more  ISQED 2005»
15 years 3 months ago
Toward Quality EDA Tools and Tool Flows Through High-Performance Computing
As the scale and complexity of VLSI circuits increase, Electronic Design Automation (EDA) tools become much more sophisticated and are held to increasing standards of quality. New...
Aaron N. Ng, Igor L. Markov
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke
IRI
2006
IEEE
15 years 3 months ago
A similarity based technique for detecting malicious executable files for computer forensics
With the rapidly increasing complexity of computer systems and the sophistication of hacking tools and techniques, there is a crucial need for computer forensic analysis technique...
Jun-Hyung Park, Minsoo Kim, BongNam Noh, James B. ...