77 search results - page 8 / 16 » Timing optimization by restructuring long combinatorial path... |
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
DATE
2000
IEEE
13 years 11 months ago
2000
IEEE
Embedded systems make a heavy use of software to perform Real-Time embedded control tasks. Embedded software is characterized by a relatively long lifetime and by tight cost, perf...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper addresses planning of continuous paths for mobile sensors to improve long-term forecast performance. With the information gain defined by the mutual information bet...
DISOPT
2010
13 years 7 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...