Sciweavers

379 search results - page 14 / 76
» Strong reducibility of partial numberings
Sort
View
ERSA
2010
153views Hardware» more  ERSA 2010»
13 years 5 months ago
VAPRES: A Customizable and Flexible Base Architecture for Partially Reconfigurable Systems
- Partial reconfiguration (PR) enhances traditional FPGA-based high-performance reconfigurable computing by providing additional benefits such as reduced area and memory requiremen...
Ann Gordon-Ross, Abelardo Jara-Berrocal
ASE
2004
167views more  ASE 2004»
13 years 7 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
CMS
2006
150views Communications» more  CMS 2006»
13 years 9 months ago
Attribute Delegation Based on Ontologies and Context Information
This paper presents a model for delegation based on partial orders, proposing the subclass relation in OWL as a way to represent the partial orders. Delegation and authorization de...
Isaac Agudo, Javier Lopez, José A. Monteneg...
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
14 years 28 days ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...