Sciweavers

2450 search results - page 37 / 490
» Time Mapping with Hypergraphs
Sort
View
ENTCS
2007
126views more  ENTCS 2007»
14 years 9 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
SEMWEB
2009
Springer
15 years 4 months ago
Computing Minimal Mappings
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
Fausto Giunchiglia, Vincenzo Maltese, Aliaksandr A...
BIS
2009
154views Business» more  BIS 2009»
14 years 10 months ago
Using Process Mining to Generate Accurate and Interactive Business Process Maps
Abstract. The quality of today's digital maps is very high. This allows for new functionality as illustrated by modern car navigation systems (e.g., TomTom, Garmin, etc.), Goo...
Wil M. P. van der Aalst
DAC
1994
ACM
15 years 1 months ago
Technology Mapping Using Fuzzy Logic
- This paper presents a placement-driven technology mapping procedure based on fuzzy delay curves. The fuzziness has been introduced to deal with the inherent vagueness in wiring l...
Sasan Iman, Massoud Pedram, Kamal Chaudhary
ASPDAC
2004
ACM
113views Hardware» more  ASPDAC 2004»
15 years 1 months ago
Area-minimal algorithm for LUT-based FPGA technology mapping with duplication-free restriction
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
Chi-Chou Kao, Yen-Tai Lai