Sciweavers

2225 search results - page 295 / 445
» Logical Structures in the Lexicon
Sort
View
JLP
2007
114views more  JLP 2007»
15 years 6 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
WICOMM
2008
122views more  WICOMM 2008»
15 years 6 months ago
Energy and connectivity performance of routing groups in multi-radio multi-hop networks
This paper explores the logical device aggregation of terminals in future generation networks, where the availability of several different radio access techniques is integrated by...
Michele Rossi, Leonardo Badia, Paolo Giacon, Miche...
TCAD
2002
134views more  TCAD 2002»
15 years 6 months ago
Testing and diagnosis of interconnect faults in cluster-based FPGA architectures
As IC densities are increasing, cluster-based FPGA architectures are becoming the architecture of choice for major FPGA manufacturers. A cluster-based architecture is one in which...
Ian G. Harris, Russell Tessier
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
CLP-based protein fragment assembly
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
Alessandro Dal Palù, Agostino Dovier, Feder...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker