Sciweavers

246 search results - page 2 / 50
» Stable domination and weight
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 8 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
SMA
2010
ACM
235views Solid Modeling» more  SMA 2010»
13 years 5 months ago
Constructing A-spline weight functions for stable WEB-spline finite element methods
Whereas traditional finite element methods use meshes to define domain geometry, weighted extended B-spline finite element methods rely on a weight function. A weight function is ...
Chandrajit L. Bajaj, Radhakrishna Bettadapura, Na ...
ISAAC
1993
Springer
134views Algorithms» more  ISAAC 1993»
13 years 9 months ago
Weighted Independent Perfect Domination on Cocomparability Graphs
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
COMMA
2010
13 years 4 sec ago
Generalizing stable semantics by preferences
Different proposals have been made in the literature for refining Dung's argumentation framework by preferences between arguments. The idea is to ignore an attack if the atta...
Leila Amgoud, Srdjan Vesic
LPNMR
2005
Springer
13 years 10 months ago
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Lengning Liu, Miroslaw Truszczynski