1184 search results - page 122 / 237 » Nearness relations and topology |
CC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
ENTER
2007
Springer
14 years 4 months ago
2007
Springer
How to reveal throughout a quantitative survey of the websites the cooperation development of a tourism destination? The analysis of the links among the tourist websites of a dest...
IWSOS
2007
Springer
14 years 4 months ago
2007
Springer
A routing protocol is designed considering a particular environment all the time which is not possible in the case of practical ad hoc networks. Because of the uncertainty in topol...
SIBGRAPI
2005
IEEE
14 years 3 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
ARCS
2005
Springer
14 years 3 months ago
2005
Springer
All known life forms process information on a molecular level. This kind of chemical information processing is known to be robust, self-organizing, adaptive, decentralized, asynch...