3775 search results - page 192 / 755 » The Expression Problem Revisited |
136
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
130
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
131
Voted
PODS
2010
ACM
15 years 9 months ago
2010
ACM
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
154
click to vote
CONEXT
2005
ACM
15 years 5 months ago
2005
ACM
While the applications using the Internet have changed over time, TCP is still the dominating transport protocol that carries over 90% of the total traffic. Throughput is the key...
155
click to vote
SIGCOMM
2010
ACM
15 years 4 months ago
2010
ACM
We revisit the device-driver architecture supported by the majority of operating systems, where a driver is a passive object that does not have its own thread of control and is on...