Sciweavers

6926 search results - page 191 / 1386
» A More Effective CEFF
Sort
View
IJCAI
1993
15 years 7 months ago
An Inductive Approach to Learning Search Control Rules for Planning
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
Christopher Leckie, Ingrid Zukerman
IJCAI
1989
15 years 7 months ago
Reconstructive Explanation: Explanation as Complex Problem Solving
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
Michael R. Wick, William B. Thompson
GRC
2008
IEEE
15 years 7 months ago
Towards Real-time Performance of Data Value Hiding for Frequent Data Updates
Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models...
Jie Wang, Justin Zhan, Jun Zhang
MICRO
2006
IEEE
71views Hardware» more  MICRO 2006»
15 years 6 months ago
Efficient Runahead Execution: Power-Efficient Memory Latency Tolerance
Runahead execution improves memory latency tolerance without significantly increasing processor complexity. Unfortunately, a runahead execution processor executes significantly mo...
Onur Mutlu, Hyesoon Kim, Yale N. Patt
IJBRA
2007
57views more  IJBRA 2007»
15 years 6 months ago
Decoding algorithms in pooling designs with inhibitors and error-tolerance
: Pooling designs are used in DNA library screening to efficiently distinguish positive from negative clones, which is fundamental for studying gene functions and many other biolog...
My T. Thai, David MacCallum, Ping Deng, Weili Wu