914 search results - page 18 / 183 » Branch and Bound on the Network Model |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
ICN
2005
Springer
14 years 28 days ago
2005
Springer
Proposed by Maurer the bounded storage model has received much academic attention in the recent years. Perhaps the main reason for this attention is that the model facilitates a un...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
ICONIP
2007
13 years 8 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
FGCN
2007
IEEE
14 years 1 months ago
2007
IEEE
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...