Sciweavers

589 search results - page 15 / 118
» Generalized Dominators and Post-Dominators
Sort
View
ICCAD
2005
IEEE
105views Hardware» more  ICCAD 2005»
14 years 4 months ago
Weighted control scheduling
Abstract — This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. S...
Aravind Vijayakumar, Forrest Brewer
SCAM
2008
IEEE
14 years 1 months ago
Is Cloned Code More Stable than Non-cloned Code?
This paper presents a study on the stability of cloned code. The results from an analysis of 200 weeks of evolution of five software system show that the stability as measured by...
Jens Krinke
ACL
2000
13 years 8 months ago
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
Alexander Koller, Kurt Mehlhorn, Joachim Niehren
IJCM
2008
72views more  IJCM 2008»
13 years 7 months ago
ROMAN DOMINATION: a parameterized perspective
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
Henning Fernau
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
14 years 7 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung