12597 search results - page 2507 / 2520 » Complexity of Mechanism Design |
82
Voted
PVLDB
2010
14 years 8 months ago
2010
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...
107
Voted
RTAS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
96
Voted
SAT
2010
Springer
14 years 8 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
104
click to vote
SIGMOD
2010
ACM
14 years 8 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...