1058 search results - page 109 / 212 » It's Doomed; We Can Prove It |
ICLP
1999
Springer
14 years 2 months ago
1999
Springer
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
SPAA
1997
ACM
14 years 2 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
COMPGEOM
2007
ACM
13 years 12 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
JACM
2006
13 years 10 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
MOBIHOC
2009
ACM
14 years 10 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...