Sciweavers

10907 search results - page 2153 / 2182
» Constraint Based Strategies
Sort
View
AAAI
2008
14 years 1 days ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
BIBE
2010
IEEE
144views Bioinformatics» more  BIBE 2010»
14 years 20 hour ago
Knowledge-Guided Docking of Flexible Ligands to SH2 Domain Proteins
Studies of interactions between protein domains and ligands are important in many aspects such as cellular signaling and regulation. In this work, we applied a three-stage knowledg...
Haiyun Lu, Shamima Banu Bte Sm Rashid, Hao Li, Wee...
DAC
2010
ACM
14 years 13 hour ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
ECRTS
2010
IEEE
14 years 9 hour ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 8 hour ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
« Prev « First page 2153 / 2182 Last » Next »