Sciweavers

2022 search results - page 269 / 405
» Complexity of Non-Monotonic Logics
Sort
View
ICLP
2003
Springer
15 years 11 months ago
On Deterministic Computations in the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...
DATE
2002
IEEE
79views Hardware» more  DATE 2002»
15 years 11 months ago
Incremental Diagnosis and Correction of Multiple Faults and Errors
An incremental simulation-based approach to fault diagnosis and logic debugging is presented. During each iteration of the algorithm, a single suspicious location is identified a...
Andreas G. Veneris, Jiang Brandon Liu, Mandana Ami...
FPL
2009
Springer
85views Hardware» more  FPL 2009»
15 years 11 months ago
Generating high-performance custom floating-point pipelines
Custom operators, working at custom precisions, are a key ingredient to fully exploit the FPGA flexibility advantage for high-performance computing. Unfortunately, such operators...
Florent de Dinechin, Cristian Klein, Bogdan Pasca
ICANN
2009
Springer
15 years 11 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
PODS
1999
ACM
89views Database» more  PODS 1999»
15 years 10 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller