5227 search results - page 621 / 1046 » Enterprise modeling using class and instance models |
192
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
188
Voted
MLMI
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Decision making is an important aspect of meetings in organisational settings, and archives of meeting recordings constitute a valuable source of information about the de...
197
Voted
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—In order to ensure fair access and efficiency of bandwidth usage in wireless integrated networks, resource allocation algorithms should be well designed. In this paper,...
155
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
182
Voted
CCCG
2008
15 years 8 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...