Sciweavers

3907 search results - page 330 / 782
» Time, Knowledge, and Choice
Sort
View
CP
2003
Springer
16 years 13 hour ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 12 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...
CSMR
2002
IEEE
15 years 11 months ago
Combining Static and Dynamic Views for Architecture Reconstruction
Static analysis aims at recovering the structure of a software system, while dynamic analysis focuses on its run time behaviour. We propose a technique for combining the analysis ...
Claudio Riva, Jordi Vidal Rodríguez
DSN
2002
IEEE
15 years 11 months ago
On the Placement of Software Mechanisms for Detection of Data Errors
An important aspect in the development of dependable software is to decide where to locate mechanisms for efficient error detection and recovery. We present a comparison between ...
Martin Hiller, Arshad Jhumka, Neeraj Suri
HPCA
2002
IEEE
15 years 11 months ago
Fine-Grain Priority Scheduling on Multi-Channel Memory Systems
Configurations of contemporary DRAM memory systems become increasingly complex. A recent study [5] shows that application performance is highly sensitive to choices of configura...
Zhichun Zhu, Zhao Zhang, Xiaodong Zhang