Sciweavers

28888 search results - page 276 / 5778
» Computability and complexity in analysis
Sort
View
LICS
2010
IEEE
15 years 4 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
CHI
2006
ACM
16 years 7 months ago
Non-visual overviews of complex data sets
Johan Kildal, Stephen A. Brewster
ARC
2008
Springer
128views Hardware» more  ARC 2008»
15 years 8 months ago
A Framework for the Automatic Generation of Instruction-Set Extensions for Reconfigurable Architectures
Abstract. In this paper we present a framework for the automatic identification and selection of convex MIMO instruction-set extensions for reconfigurable architecture. The framewo...
Carlo Galuzzi, Koen Bertels