Sciweavers

76 search results - page 6 / 16
» Static Analysis by Policy Iteration on Relational Domains
Sort
View
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 7 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
JAIR
2011
134views more  JAIR 2011»
13 years 2 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 2 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
ACMDIS
2004
ACM
14 years 23 days ago
Making tea: iterative design through analogy
The success of translating an analog or manual practice into a digital interactive system may depend on how well that translation captures not only the functional what and how asp...
Monica M. C. Schraefel, Gareth V. Hughes, Hugo R. ...