Sciweavers

16504 search results - page 110 / 3301
» New Problems, New Solutions
Sort
View
JSAT
2006
109views more  JSAT 2006»
15 years 6 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
16 years 14 days ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
AIPS
2000
15 years 7 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
PKC
2001
Springer
111views Cryptology» more  PKC 2001»
15 years 10 months ago
Cryptanalysis of PKP: A New Approach
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
Éliane Jaulmes, Antoine Joux
AAAI
2008
15 years 8 months ago
Zero-data Learning of New Tasks
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
Hugo Larochelle, Dumitru Erhan, Yoshua Bengio