Sciweavers

1000 search results - page 141 / 200
» Nominal rewriting systems
Sort
View
COOPIS
2003
IEEE
14 years 2 months ago
Query Evaluation in Peer-to-Peer Networks of Taxonomy-Based Sources
We consider the problem of query evaluation in Peer-to-Peer (P2P) systems that support semantic-based retrieval services. We confine ourselves to the case where the peers employ t...
Yannis Tzitzikas, Carlo Meghini
SCAM
2002
IEEE
14 years 1 months ago
Parallel Support for Source Code Analysis and Modification
Tools that analyze and enhance large-scale software systems using symbolic reasoning are computationally expensive, and yet processors are cheap. We believe that enabling tools wi...
Ira D. Baxter
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
14 years 1 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
ASPDAC
2009
ACM
249views Hardware» more  ASPDAC 2009»
14 years 1 months ago
Automatic generation of Cycle Accurate and Cycle Count Accurate transaction level bus models from a formal model
— This paper proposes the first automatic approach to simultaneously generate Cycle Accurate and Cycle Count Accurate transaction level bus models. Since TLM (Transaction Level M...
Chen Kang Lo, Ren-Song Tsay
LCR
1998
Springer
109views System Software» more  LCR 1998»
14 years 29 days ago
Expressing Irregular Computations in Modern Fortran Dialects
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
Jan Prins, Siddhartha Chatterjee, Martin Simons