4674 search results - page 107 / 935 » cases 2008 |
225
click to vote
GLOBECOM
2008
IEEE
16 years 12 days ago
2008
IEEE
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
165
click to vote
DAM
2008
15 years 6 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
153
click to vote
EOR
2008
15 years 6 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
109
click to vote
DM
2006
15 years 6 months ago
2006
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
143
click to vote
STVR
2002
15 years 5 months ago
2002
This paper describes the use of conditioned slicing to assist partition testing, illustrating this with a case study. The paper shows how a conditioned slicing tool can be used to...