1278 search results - page 143 / 256 » Quality in Distance Education |
113
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
— this paper presents an enhancement of the medial axis algorithm to be used for finding the optimal shortest path for developed cognitive map. The cognitive map has been develop...
CORR
2011
Springer
14 years 7 months ago
2011
Springer
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
93
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
131
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract- In order to prevent detection and evade signature-based scanning methods, which are normally exploited by antivirus softwares, metamorphic viruses use several various obf...