Sciweavers

3105 search results - page 484 / 621
» The Path-Packing Structure of Graphs
Sort
View
135
Voted
PVLDB
2008
121views more  PVLDB 2008»
15 years 3 months ago
QueryScope: visualizing queries for repeatable database tuning
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automati...
Ling Hu, Kenneth A. Ross, Yuan-Chi Chang, Christia...
109
Voted
ATMOS
2010
136views Optimization» more  ATMOS 2010»
15 years 2 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
145
Voted
ECCC
2010
92views more  ECCC 2010»
15 years 2 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
154
Voted
JOT
2010
173views more  JOT 2010»
15 years 2 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta
142
Voted
TCS
2010
15 years 2 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...