Sciweavers

610 search results - page 103 / 122
» Using SAT in QBF
Sort
View
CSR
2007
Springer
14 years 1 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
ICMCS
2006
IEEE
132views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Analysis and Evaluation of the Skype and Google-Talk Voip Systems
In this paper, we study Skype and Google Talk, two widely used VoIP systems, and compare their perceptual speech quality with that of our proposed system using UDP packet traces c...
Batu Sat, Benjamin W. Wah
WACV
2005
IEEE
14 years 1 months ago
Learning the Behavior of Users in a Public Space through Video Tracking
The paper describes a video tracking system that tracks and analyzes the behavioral pattern of users in a public space. We have obtained important statistical measurements about u...
Wei Yan, David A. Forsyth
DAC
2010
ACM
13 years 11 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert
AIPS
2000
13 years 9 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner