Sciweavers

1033 search results - page 168 / 207
» The Relative History Heuristic
Sort
View
INFOCOM
2000
IEEE
15 years 3 months ago
A Modular Approach to Packet Classification: Algorithms and Results
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
Thomas Y. C. Woo
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
15 years 3 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
AAAI
2008
15 years 2 months ago
Exploiting Causal Independence Using Weighted Model Counting
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
Wei Li 0002, Pascal Poupart, Peter van Beek
AAAI
2007
15 years 2 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
WSC
2007
15 years 2 months ago
Estimating the probability of a rare event over a finite time horizon
We study an approximation for the zero-variance change of measure to estimate the probability of a rare event in a continuous-time Markov chain. The rare event occurs when the cha...
Pieter-Tjerk de Boer, Pierre L'Ecuyer, Gerardo Rub...