2254 search results - page 162 / 451 » Computing the minimal covering set |
208
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
195
click to vote
FOCM
2011
15 years 1 months ago
2011
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
168
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
167
click to vote
TIT
2010
15 years 1 months ago
2010
We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel state...
189
click to vote
DM
2006
15 years 6 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...