Sciweavers

1578 search results - page 227 / 316
» Induction of Stable Models
Sort
View
FTCS
1998
91views more  FTCS 1998»
14 years 10 hour ago
How Fail-Stop are Faulty Programs?
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
Subhachandra Chandra, Peter M. Chen
CORR
2008
Springer
234views Education» more  CORR 2008»
13 years 10 months ago
Bayesian Compressive Sensing via Belief Propagation
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-N...
Dror Baron, Shriram Sarvotham, Richard G. Baraniuk
ECAI
2010
Springer
13 years 11 months ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
HPCA
2005
IEEE
14 years 11 months ago
Predicting Inter-Thread Cache Contention on a Chip Multi-Processor Architecture
This paper studies the impact of L2 cache sharing on threads that simultaneously share the cache, on a Chip Multi-Processor (CMP) architecture. Cache sharing impacts threads non-u...
Dhruba Chandra, Fei Guo, Seongbeom Kim, Yan Solihi...
ICLP
2010
Springer
14 years 2 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto