Sciweavers

906 search results - page 2 / 182
» Chain Dominated Orders
Sort
View
APAL
2006
54views more  APAL 2006»
13 years 5 months ago
Covering the Baire space by families which are not finitely dominating
It is consistent (relative to ZFC) that each union of max{b, g} many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consist...
Heike Mildenberger, Saharon Shelah, Boaz Tsaban
AUSAI
2010
Springer
13 years 4 months ago
Heuristic Planning with SAT: Beyond Uninformed Depth-First Search
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
Jussi Rintanen
SBACPAD
2005
IEEE
139views Hardware» more  SBACPAD 2005»
13 years 11 months ago
Chained In-Order/Out-of-Order DoubleCore Architecture
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
Miquel Pericàs, Adrián Cristal, Rube...
APPML
2010
89views more  APPML 2010»
13 years 5 months ago
An independent dominating set in the complement of a minimum dominating set of a tree
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
Michael A. Henning, Christian Löwenstein, Die...
DM
2008
137views more  DM 2008»
13 years 5 months ago
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Jo...