725 search results - page 117 / 145 » Bounding Degrees on RPL |
106
Voted
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
105
click to vote
SIES
2009
IEEE
15 years 7 months ago
2009
IEEE
—Sensor networks have been investigated in many scenarios and a good number of protocols have been developed. With the standardization of the IEEE 802.15.4 protocol, sensor netwo...
98
Voted
WG
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
83
Voted
ISSAC
2009
Springer
15 years 7 months ago
2009
Springer
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
91
Voted
AINA
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...