Sciweavers

46 search results - page 8 / 10
» Algorithms and Experimental Study for the Traveling Salesman...
Sort
View
AI
2011
Springer
12 years 9 months ago
Finding Small Backdoors in SAT Instances
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Zijie Li, Peter van Beek
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 8 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
12 years 8 months ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
ISSTA
2004
ACM
13 years 11 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
ICDE
2008
IEEE
232views Database» more  ICDE 2008»
14 years 7 months ago
Continuous Content-Based Copy Detection over Streaming Videos
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
Ying Yan, Beng Chin Ooi, Aoying Zhou