Sciweavers

892 search results - page 15 / 179
» An efficient terminal and model order reduction algorithm
Sort
View
ISMIS
2000
Springer
14 years 16 days ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
13 years 10 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
FAC
2008
100views more  FAC 2008»
13 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 1 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
DAC
1999
ACM
14 years 10 months ago
An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect
In this paper we present a new algorithm for computing reduced-order models of interconnect which utilizes the dominant controllable subspace of the system. The dominant controlla...
Jing-Rebecca Li, Frank Wang, Jacob White