4103 search results - page 293 / 821 » Some results on the Collatz problem |
159
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
185
click to vote
KI
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
190
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA tes...
172
click to vote
AIPS
2000
15 years 8 months ago
2000
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...
180
click to vote
NSPW
2006
ACM
16 years 24 days ago
2006
ACM
What would a PKI look like if it were designed for implementability and deployability rather than strict adherence to a particular theoretical or mathematical model? This paper pr...