914 search results - page 73 / 183 » Branch and Bound on the Network Model |
138
click to vote
ISCA
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
ADHOCNOW
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
JPDC
2007
14 years 9 months ago
2007
Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of wor...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected...
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...