Sciweavers

160 search results - page 32 / 32
» Satisfiability-Based Algorithms for Boolean Optimization
Sort
View
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 2 months ago
Evolutionary testing of state-based programs
The application of Evolutionary Algorithms to structural test data generation, known as Evolutionary Testing, has to date largely focused on programs with input-output behavior. H...
Phil McMinn, Mike Holcombe
BMCBI
2008
115views more  BMCBI 2008»
13 years 8 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 8 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 1 months ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
FSTTCS
2009
Springer
14 years 3 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...