Sciweavers

2911 search results - page 408 / 583
» A Logic of Graph Constraints
Sort
View
POPL
2009
ACM
16 years 1 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
114
Voted
AAAI
2007
15 years 3 months ago
An Investigation into Computational Recognition of Children's Jokes
bstract or nonliving entities act or are described as living. And living things gain extra benefits such as animals talking. For this reason, the standard scripts are modified to a...
Julia M. Taylor, Lawrence J. Mazlack
DAC
2001
ACM
16 years 1 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
111
Voted
ICML
2008
IEEE
16 years 1 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
FUZZIEEE
2007
IEEE
15 years 7 months ago
Social Measures and Flexible Navigation on Online Contact Networks
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
Nikolaos Korfiatis, Miguel-Ángel Sicilia