4298 search results - page 151 / 860 » Computing at the top of the world |
111
click to vote
NSPW
2004
ACM
15 years 7 months ago
2004
ACM
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
131
Voted
PPSN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
105
click to vote
HICSS
2000
IEEE
15 years 6 months ago
2000
IEEE
With the recent trend towards deregulating power systems around the world, transfer capability computation emerges as the key issue to a smoothly running power market with multipl...
STACS
1999
Springer
15 years 6 months ago
1999
Springer
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
CAISE
2006
Springer
15 years 5 months ago
2006
Springer
The war metaphor seems to establish itself as soon as we deal with computer viruses. The concept of war is a central topic of political philosophy. The relationships between "...