Sciweavers

271 search results - page 25 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
CASES
2010
ACM
13 years 6 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
TLCA
2005
Springer
14 years 1 months ago
Privacy in Data Mining Using Formal Methods
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
Stan Matwin, Amy P. Felty, István T. Hern&a...
OTM
2005
Springer
14 years 1 months ago
Document Flow Model: A Formal Notation for Modelling Asynchronous Web Services Composition
This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can b...
Jingtao Yang, Corina Cîrstea, Peter Henderso...
CCR
2008
110views more  CCR 2008»
13 years 8 months ago
Operational comparison of available bandwidth estimation tools
The available bandwidth of a path directly impacts the performance of throughput sensitive applications, e.g., p2p content replication or podcasting. Several tools have been devis...
Guillaume Urvoy-Keller, Taoufik En-Najjary, Alessa...
LOGCOM
2007
130views more  LOGCOM 2007»
13 years 7 months ago
A Logic for Concepts and Similarity
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...