Sciweavers

723 search results - page 41 / 145
» Reducing the complexity of the issue logic
Sort
View
EACL
2003
ACL Anthology
13 years 9 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
ICCAD
2009
IEEE
101views Hardware» more  ICCAD 2009»
13 years 5 months ago
Compacting test vector sets via strategic use of implications
As the complexity of integrated circuits has increased, so has the need for improving testing efficiency. Unfortunately, the types of defects are also becoming more complex, which...
Nuno Alves, Jennifer Dworak, R. Iris Bahar, Kundan...
EDBT
2002
ACM
112views Database» more  EDBT 2002»
14 years 7 months ago
Querying with Intrinsic Preferences
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and ex...
Jan Chomicki
ETFA
2006
IEEE
14 years 1 months ago
A Framework for Fault Tolerant Real Time Systems Based on Reconfigurable FPGAs
♦ To increase the amount of logic available to the users in SRAM-based FPGAs, manufacturers are using nanometric technologies to boost logic density and reduce costs, making its ...
Manuel G. Gericota, Luís F. Lemos, Gustavo ...
AIIA
2003
Springer
14 years 26 days ago
A Complete Subsumption Algorithm
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...