Sciweavers

82 search results - page 10 / 17
» Spanning Trees Short or Small
Sort
View

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
ICSM
2002
IEEE
14 years 15 days ago
An Approach to Classify Software Maintenance Requests
When a software system critical for an organization exhibits a problem during its operation, it is relevant to fix it in a short period of time, to avoid serious economical losse...
Giuseppe A. Di Lucca, Massimiliano Di Penta, Sara ...
STACS
2001
Springer
13 years 12 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 4 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
13 years 11 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti