3192 search results - page 121 / 639 » The minimum latency problem |
132
click to vote
TCS
2008
15 years 3 months ago
2008
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
141
click to vote
WG
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
131
click to vote
WACV
2008
IEEE
15 years 10 months ago
2008
IEEE
deliver objects, handle emergency, wherever he/she is inside the home. In addition, the burden of processing We address issues dealing with distributed visual power can be distribu...
146
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
126
click to vote
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...