Sciweavers

1322 search results - page 94 / 265
» Parameterized counting problems
Sort
View
HASE
1998
IEEE
14 years 1 months ago
A New Heuristic to Discriminate between Transient and Intermittent Faults
Effective discrimination between transient and permanent faults is a very important practical problem in (dependable) system design. A count-andthreshold mechanism named -count, d...
Fabrizio Grandoni 0002, Andrea Bondavalli, Silvano...
JOT
2007
69views more  JOT 2007»
13 years 8 months ago
Form over Substance
Beware of the colleague or supplier who spends large amounts of time in meetings discussing the format, sequence, and wording of documents they will deliver and very little time o...
John McGregor
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
13 years 8 months ago
Tilings of Diamonds and Hexagons with Defects
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we...
Harald Helfgott, Ira M. Gessel
ICLP
2001
Springer
14 years 1 months ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
ICDE
2004
IEEE
144views Database» more  ICDE 2004»
14 years 10 months ago
Spatio-Temporal Aggregation Using Sketches
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
Yufei Tao, George Kollios, Jeffrey Considine, Feif...