Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
Small-sample learning in image retrieval is a pertinent and interesting problem. Relevance feedback is an active area of research that seeks to find algorithms that are robust wi...
Charlie K. Dagli, ShyamSundar Rajaram, Thomas S. H...
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
Models of learning and performing by exploration assume that the semantic distance between task descriptions and screen labels controls in part the usersÕ search strategies. Neve...