8413 search results - page 82 / 1683 » Ordering Problem Subgoals |
CAIP
2001
Springer
14 years 17 days ago
2001
Springer
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies ...
ASIACRYPT
2000
Springer
14 years 12 days ago
2000
Springer
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
AISC
2008
Springer
13 years 10 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
ACST
2006
13 years 9 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...