5624 search results - page 845 / 1125 » On Conditional Covering Problem |
152
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
130
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
149
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
164
click to vote
MMB
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
137
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...