Sciweavers

5810 search results - page 937 / 1162
» An Approach to Programming Based on Concepts
Sort
View
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 7 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ICALP
2009
Springer
16 years 6 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 6 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
ICSE
2004
IEEE-ACM
16 years 6 months ago
Runtime Verification of Statechart Implementations
Our paper introduces a runtime verification framework for concurrent monitoring of applications specified by UML statecharts. The approach offers a considerable degree of granulari...
Gergely Pintér, István Majzik
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
16 years 1 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard