Sciweavers

370 search results - page 49 / 74
» Independent Sets with Domination Constraints
Sort
View
ANOR
2005
160views more  ANOR 2005»
15 years 1 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
CP
2006
Springer
15 years 5 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
ICCV
2007
IEEE
16 years 3 months ago
A Symmetry-Based Generative Model for Shape
We propose a novel generative language for shape that is based on the shock graph: given a shock graph topology, we explore constraints on the geometry and dynamics of the shock g...
Nhon H. Trinh, Benjamin B. Kimia
ICSE
2008
IEEE-ACM
16 years 2 months ago
Detecting model inconsistency through operation-based model construction
Nowadays, large-scale industrial software systems may involve hundreds of developers working on hundreds of different but related models representing parts of the same system spec...
Xavier Blanc, Isabelle Mounier, Alix Mougenot, Tom...
IPPS
2006
IEEE
15 years 8 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...