68 search results - page 13 / 14 » Impossibility Results for the Equational Theory of Timed CCS |
POPL
2006
ACM
14 years 6 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
AIS
2006
Springer
13 years 5 months ago
2006
Springer
Today's computer network technologies are sociologically founded on hunter-gatherer principles; common users may be possible subjects of surveillance and sophisticated Interne...
CG
2006
Springer
13 years 5 months ago
2006
Springer
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
VIS
2009
IEEE
14 years 6 months ago
2009
IEEE
In this paper we describe a novel method to integrate interactive visual analysis and machine learning to support the insight generation of the user. The suggested approach combine...
CONEXT
2009
ACM
13 years 6 months ago
2009
ACM
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...