264 search results - page 40 / 53 » On the possibility of faster SAT algorithms |
ICTAI
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
ACCV
2006
Springer
15 years 4 months ago
2006
Springer
Construction of key poses is one of the most tedious and time consuming steps in synthesizing of 3D virtual actors. Recent alternate schemes expect the user to specify two inputs. ...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
92
Voted
CPM
1999
Springer
15 years 2 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
ISPD
1998
ACM
15 years 2 months ago
1998
ACM
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...