5580 search results - page 175 / 1116 » Randomized priority algorithms |
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
90
Voted
ICALP
2007
Springer
15 years 2 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
101
click to vote
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Wireless mesh network (WMN) has emerged recently as a promising technology for next-generation wireless networking. In WMN, it is important to provide an efficient hand...
153
click to vote
MOBIQUITOUS
2008
IEEE
15 years 4 months ago
2008
IEEE
Heterogeneous applications could be assimilated within the same wireless sensor network with the aid of modern motes that have multiple sensor boards on a single radio board. Diff...
ICSM
2006
IEEE
15 years 4 months ago
2006
IEEE
The test case execution order affects the time at which the objectives of testing are met. If the objective is fault detection, an inappropriate execution order might reveal most ...