1568 search results - page 176 / 314 » The problem of examination questions in algorithmics |
184
click to vote
TMC
2010
15 years 4 months ago
2010
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
178
click to vote
MST
2006
15 years 6 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
187
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
183
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...