844 search results - page 74 / 169 » Solving the p |
159
click to vote
RTAS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we study the problem of allocating end-toend bandwidth to each of multiple traffic flows in a largescale network. We adopt the QoS-based Resource Allocation Model...
132
click to vote
VLSID
2005
IEEE
2005
IEEE
Formal Methods for Analyzing the Completeness of an Assertion Suite against a High-Level Fault Model
15 years 11 months ago
One of the emerging challenges in formal property verification (FPV) technology is the problem of deciding whether sufficient properties have been written to cover the design in...
166
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
144
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
140
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...