Sciweavers

21319 search results - page 3693 / 4264
» An Approach for Method Reengineering
Sort
View
AAAI
2008
15 years 9 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
FAST
2010
15 years 9 months ago
Write Endurance in Flash Drives: Measurements and Analysis
We examine the write endurance of USB flash drives using a range of approaches: chip-level measurements, reverse engineering, timing analysis, whole-device endurance testing, and ...
Simona Boboila, Peter Desnoyers
AAAI
2008
15 years 9 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
AAAI
2008
15 years 9 months ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
AAAI
2008
15 years 9 months ago
Transfer Learning via Dimensionality Reduction
Transfer learning addresses the problem of how to utilize plenty of labeled data in a source domain to solve related but different problems in a target domain, even when the train...
Sinno Jialin Pan, James T. Kwok, Qiang Yang
« Prev « First page 3693 / 4264 Last » Next »