Sciweavers

1199 search results - page 141 / 240
» Automated Extraction of Problem Structure
Sort
View
DLOG
2010
13 years 7 months ago
Automata-Based Abduction for Tractable Diagnosis
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
LICS
2010
IEEE
13 years 7 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
IHI
2010
132views Healthcare» more  IHI 2010»
13 years 4 months ago
Section classification in clinical notes using supervised hidden markov model
As more and more information is available in the Electronic Health Record in the form of free-text narrative, there is a need for automated tools, which can process and understand...
Ying Li, Sharon Lipsky Gorman, Noemie Elhadad
ICLP
2011
Springer
13 years 23 days ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 4 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko