Sciweavers

88 search results - page 11 / 18
» Cycle Covering
Sort
View
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
ICDCSW
2008
IEEE
14 years 2 months ago
Mobility Control for Complete Coverage in Wireless Sensor Networks
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
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
ECSA
2007
Springer
14 years 1 months ago
Pattern-Based Evolution of Software Architectures
Abstract. We propose a pattern-based software development method comprising analysis (using problem frames) and design (using architectural and design patterns), of which especiall...
Isabelle Côté, Maritta Heisel, Ina We...
IMC
2010
ACM
13 years 5 months ago
Primitives for active internet topology mapping: toward high-frequency characterization
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...
Robert Beverly, Arthur Berger, Geoffrey G. Xie