5100 search results - page 982 / 1020 » The Linear Complexity of a Graph |
235
click to vote
GIS
2007
ACM
16 years 5 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
219
click to vote
GIS
2008
ACM
16 years 5 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
130
click to vote
SIGSOFT
2008
ACM
16 years 4 months ago
2008
ACM
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
147
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
138
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...