Sciweavers

3630 search results - page 611 / 726
» Fast Marching Methods
Sort
View
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 7 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
15 years 7 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
DSOM
2000
Springer
15 years 7 months ago
Using Message Reflection in a Management Architecture for CORBA
The availability of object middleware, such as CORBA, is rapidly being accepted as a means for cost effective and fast development for a wide range of distributed applications. Dis...
Maarten Wegdam, Dirk-Jaap Plas, Aart van Halteren,...
DAC
1999
ACM
15 years 7 months ago
Behavioral Synthesis of Analog Systems Using Two-layered Design Space Exploration
This paper presents a novel approach for synthesis of analog systems from behavioral VHDL-AMS specifications. We implemented this approach in the VASE behavioral-synthesis tool. ...
Alex Doboli, Adrián Núñez-Ald...
DAC
1999
ACM
15 years 7 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther