4103 search results - page 458 / 821 » Some results on the Collatz problem |
155
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
160
click to vote
AAAI
2006
15 years 8 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
202
click to vote
AAAI
2006
15 years 8 months ago
2006
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
143
click to vote
CSC
2006
15 years 8 months ago
2006
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
175
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Many software systems contained cloned code, i.e., segments of code that are highly similar to each other, typically because one has been copied from the other, and then possibly m...