734 search results - page 120 / 147 » Undecidability over Continuous Time |
IWCMC
2010
ACM
14 years 3 months ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
SOFSEM
2000
Springer
14 years 1 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
MMM
2010
Springer
14 years 19 hour ago
2010
Springer
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
ENTCS
2008
13 years 10 months ago
2008
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
PR
2007
13 years 9 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...