3192 search results - page 181 / 639 » The minimum latency problem |
125
click to vote
RSA
2000
15 years 4 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
125
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
135
click to vote
DAM
2002
15 years 4 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
130
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
159
click to vote
RTCSA
2008
IEEE
15 years 10 months ago
2008
IEEE
The demand for real-time data services in embedded systems is increasing. In these new computing platforms, using traditional buffer management schemes, whose goal is to minimize ...