Sciweavers

158 search results - page 27 / 32
» A Framework for Assertion-Based Debugging in Constraint Logi...
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
ICCAD
2006
IEEE
141views Hardware» more  ICCAD 2006»
14 years 4 months ago
Design optimization for single-event upset robustness using simultaneous dual-VDD and sizing techniques
An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU robustne...
Mihir R. Choudhury, Quming Zhou, Kartik Mohanram
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 7 months ago
Cardinality heterogeneities in Web service composition: Issues and solutions
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
Michael Mrissa, Philippe Thiran, Jean-Marie Jacque...
CORR
2011
Springer
179views Education» more  CORR 2011»
13 years 2 months ago
An overview of Ciao and its design philosophy
We provide an overall description of the Ciao multiparadigm programming system emphasizing some of the novel aspects and motivations behind its design and implementation. An impor...
Manuel V. Hermenegildo, Francisco Bueno, Manuel Ca...
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 8 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia