1941 search results - page 195 / 389 » On the Hardness of Approximate Reasoning |
184
click to vote
IFIP
2005
Springer
15 years 12 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
175
click to vote
SAT
2005
Springer
15 years 12 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
147
click to vote
SIGMETRICS
2004
ACM
15 years 12 months ago
2004
ACM
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
180
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
171
click to vote
IFIP
2003
Springer
15 years 11 months ago
2003
Springer
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...