Sciweavers

46 search results - page 7 / 10
» On the topological lower bound for the multichromatic number
Sort
View
SIROCCO
2000
14 years 11 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
IJAHUC
2007
111views more  IJAHUC 2007»
14 years 9 months ago
Configuring node status in a two-phase tightly integrated mode for wireless sensor networks
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
Di Tian, Zhijun Lei, Nicolas D. Georganas
82
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
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 ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
AMC
2007
102views more  AMC 2007»
14 years 9 months ago
Existence and computation of short-run equilibria in economic geography
The new economic geography literature provides a general equilibrium framework that explains the emergence of economic agglomerations as a trade-off between increasing returns at...
Nicos G. Pavlidis, Michael N. Vrahatis, P. Mossay
JPDC
2007
173views more  JPDC 2007»
14 years 9 months ago
Probabilistic analysis on mesh network fault tolerance
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...
Jianer Chen, Gaocai Wang, Chuang Lin, Tao Wang, Gu...