Sciweavers

5668 search results - page 897 / 1134
» Overlaps in Requirements Engineering
Sort
View
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 11 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 11 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
CLOUD
2010
ACM
15 years 11 months ago
Hermes: clustering users in large-scale e-mail services
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
Thomas Karagiannis, Christos Gkantsidis, Dushyanth...
MSR
2010
ACM
15 years 11 months ago
The Ultimate Debian Database: Consolidating bazaar metadata for Quality Assurance and data mining
—FLOSS distributions like RedHat and Ubuntu require a lot more complex infrastructures than most other FLOSS projects. In the case of community-driven distributions like Debian, ...
Lucas Nussbaum, Stefano Zacchiroli
CODES
2002
IEEE
15 years 11 months ago
Energy savings through compression in embedded Java environments
Limited energy and memory resources are important constraints in the design of an embedded system. Compression is an useful and widely employed mechanism to reduce the memory requ...
Guangyu Chen, Mahmut T. Kandemir, Narayanan Vijayk...