Sciweavers

633 search results - page 63 / 127
» Locality and Hard SAT-Instances
Sort
View
AIPS
2011
13 years 1 months ago
Where Ignoring Delete Lists Works, Part II: Causal Graphs
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
Joerg Hoffmann
JAIR
2011
173views more  JAIR 2011»
13 years 24 days ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
14 years 10 months ago
Network anomaly detection based on Eigen equation compression
This paper addresses the issue of unsupervised network anomaly detection. In recent years, networks have played more and more critical roles. Since their outages cause serious eco...
Shunsuke Hirose, Kenji Yamanishi, Takayuki Nakata,...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 10 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
EMSOFT
2007
Springer
14 years 4 months ago
A dynamic scheduling approach to designing flexible safety-critical systems
The design of safety-critical systems has typically adopted static techniques to simplify error detection and fault tolerance. However, economic pressure to reduce costs is exposi...
Luís Almeida, Sebastian Fischmeister, Madhu...