Sciweavers

4266 search results - page 576 / 854
» A Framework for Defining Logics
Sort
View
JCSS
2008
107views more  JCSS 2008»
15 years 6 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens
ITA
2006
15 years 6 months ago
Complexity classes for membrane systems
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
JUCS
2008
151views more  JUCS 2008»
15 years 6 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
LISP
2008
104views more  LISP 2008»
15 years 6 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
JODS
2006
131views Data Mining» more  JODS 2006»
15 years 6 months ago
Inheritance in Rule-Based Frame Systems: Semantics and Inference
Knowledge representation languages that combine rules with object-oriented features akin to frame systems have recently attracted a lot of research interest, and F-logic is widely ...
Guizhen Yang, Michael Kifer