1405 search results - page 30 / 281 » Popularity at Minimum Cost |
FATES
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Dual-failure scenarios are a real possibility in today’s optical networks and it is becoming more and more important for carriers and network operators to consider them when ...
CCCG
2007
14 years 11 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
We present a discrete-time adaptive control law that is effective for systems that are MIMO and either minimum phase or nonminimum phase. The adaptive control algorithm provides gu...