Sciweavers

1404 search results - page 221 / 281
» Increasing Concurrency in Databases Using Program Analysis
Sort
View
102
Voted
DAC
1998
ACM
15 years 4 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 6 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
102
Voted
PVLDB
2010
191views more  PVLDB 2010»
14 years 11 months ago
SnipSuggest: Context-Aware Autocompletion for SQL
In this paper, we present SnipSuggest, a system that provides onthe-go, context-aware assistance in the SQL composition process. SnipSuggest aims to help the increasing population...
Nodira Khoussainova, YongChul Kwon, Magdalena Bala...
93
Voted
BMCBI
2008
154views more  BMCBI 2008»
15 years 20 days ago
GenomeMatcher: A graphical user interface for DNA sequence comparison
Background: The number of available genome sequences is increasing, and easy-to-use software that enables efficient comparative analysis is needed. Results: We developed GenomeMat...
Yoshiyuki Ohtsubo, Wakako Ikeda-Ohtsubo, Yuji Naga...
100
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 26 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking