635 search results - page 22 / 127 » Some Computational Problems Related to Pseudo-intents |
TCS
2010
14 years 8 months ago
2010
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...
ISPEC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. With the increased use of Internet and information technology all over the world, there is an increased amount of criminal activities that involve computing and digital d...
74
Voted
ECCC
2008
14 years 9 months ago
2008
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
106
Voted
TON
2008
14 years 9 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
67
Voted
ENTCS
2002
14 years 9 months ago
2002
Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...