Sciweavers

369 search results - page 64 / 74
» diagrams 2008
Sort
View
SEFM
2008
IEEE
13 years 12 months ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto
AAAI
2008
13 years 7 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
AIPS
2008
13 years 7 months ago
Efficient ADD Operations for Point-Based Algorithms
During the past few years, point-based POMDP solvers have gradually scaled up to handle medium sized domains through better selection of the set of points and efficient backup met...
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solom...
AIPS
2008
13 years 7 months ago
The Compression Power of Symbolic Pattern Databases
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
Marcel Ball, Robert C. Holte
APN
2008
Springer
13 years 7 months ago
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
Kais Klai, Denis Poitrenaud