Sciweavers

23 search results - page 3 / 5
» Minimal Cycle Bases of Outerplanar Graphs
Sort
View
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 3 days ago
H2 performance of agreement protocol with noise: An edge based approach
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...
Daniel Zelazo, Mehran Mesbahi
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
ICCAD
1996
IEEE
144views Hardware» more  ICCAD 1996»
13 years 11 months ago
Validation coverage analysis for complex digital designs
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
Richard C. Ho, Mark Horowitz
AAAI
2006
13 years 8 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
ICCAD
1997
IEEE
86views Hardware» more  ICCAD 1997»
13 years 11 months ago
Micro-preemption synthesis: an enabling mechanism for multi-task VLSI systems
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
Kyosun Kim, Ramesh Karri, Miodrag Potkonjak