Sciweavers

4117 search results - page 58 / 824
» On the Satisfiability of Complex Constraints
Sort
View
IJAR
2008
108views more  IJAR 2008»
14 years 12 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson
DATE
2009
IEEE
125views Hardware» more  DATE 2009»
15 years 6 months ago
Finite precision processing in wireless applications
—Complex signal processing algorithms are often specified in floating point precision. Thus, a type conversion is needed when the targeted platform requires fixed-point precis...
David Novo, Min Li, Bruno Bougard, Liesbet Van der...
ISCAS
2006
IEEE
163views Hardware» more  ISCAS 2006»
15 years 5 months ago
ASIC hardware implementation of the IDEA NXT encryption algorithm
— Symmetric-key block ciphers are often used to provide data confidentiality with low complexity, especially in the case of dedicated hardware implementations. IDEA NXT is a nov...
Marco Macchetti, Wenyu Chen
RSFDGRC
2005
Springer
127views Data Mining» more  RSFDGRC 2005»
15 years 5 months ago
Hierarchical Information Maps
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...
Andrzej Skowron, Piotr Synak
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
15 years 5 months ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu