Sciweavers

1219 search results - page 140 / 244
» Verification of Equivalent-Results Methods
Sort
View
AIPS
2006
13 years 11 months ago
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
Jörg Hoffmann, Carla P. Gomes, Bart Selman
CIC
2006
104views Communications» more  CIC 2006»
13 years 11 months ago
Closed-Loop Congestion Control Protocol Design for Elastic Traffic
In the present paper, we outline few characteristics that every viable congestion control protocol for elastic traffic should satisfy. We provide and outline ways by which these c...
Omar Ait-Hellal
IPL
2006
118views more  IPL 2006»
13 years 10 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
KI
2006
Springer
13 years 10 months ago
Gray Box Robustness Testing of Rule Systems
Due to their simple and intuitive manner rules are often used for the implementation of intelligent systems. Besides general methods for the verification and validation of rule sys...
Joachim Baumeister, Jürgen Bregenzer, Frank P...
PAA
2006
13 years 10 months ago
A review on Gabor wavelets for face recognition
Due to the robustness of Gabor features against local distortions caused by variance of illumination, expression and pose, they have been successfully applied for face recognition....
LinLin Shen, Li Bai