11565 search results - page 1938 / 2313 » Computing Minimal Mappings |
194
click to vote
SSD
2005
Springer
16 years 10 days ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
188
click to vote
WIA
2005
Springer
16 years 10 days ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
178
Voted
ACMMSP
2004
ACM
16 years 8 days ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
169
click to vote
CSCW
2004
ACM
16 years 8 days ago
2004
ACM
As communications systems increasingly gather and propagate information about people’s reachability or “presence”, users need better tools to minimize undesired interruption...
214
click to vote
DIALM
2004
ACM
16 years 8 days ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...