Sciweavers

2254 search results - page 46 / 451
» Computing the minimal covering set
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 10 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
JCB
2008
96views more  JCB 2008»
13 years 10 months ago
Computing Knock-Out Strategies in Metabolic Networks
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
Utz-Uwe Haus, Steffen Klamt, Tamon Stephen
ENC
2004
IEEE
14 years 1 months ago
Continuous Mode Changes in Mechatronic Systems
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode c...
Klaus Ecker, Andrei Tchernykh, Frank Drews, Silke ...
ICCAD
2000
IEEE
113views Hardware» more  ICCAD 2000»
14 years 2 months ago
Don't Cares and Multi-Valued Logic Network Minimization
We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and sing...
Yunjian Jiang, Robert K. Brayton
TCAD
2008
215views more  TCAD 2008»
13 years 9 months ago
Total Energy Minimization of Real-Time Tasks in an On-Chip Multiprocessor Using Dynamic Voltage Scaling Efficiency Metric
Abstract--This paper proposes an algorithm that provides both dynamic voltage scaling and power shutdown to minimize the total energy consumption of an application executed on an o...
Hyunjin Kim, Hyejeong Hong, Hong-Sik Kim, Jin-Ho A...