Sciweavers

5981 search results - page 174 / 1197
» time 2006
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 7 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
AUSDM
2006
Springer
94views Data Mining» more  AUSDM 2006»
15 years 7 months ago
Marking Time in Sequence Mining
Sequence mining is often conducted over static and temporal datasets as well as over collections of events (episodes). More recently, there has also been a focus on the mining of ...
Carl Mooney, John F. Roddick
CSREAESA
2006
15 years 5 months ago
Improving the Fault Tolerance of a Computer System with Space-Time Triple Modular Redundancy
- Triple Modular Redundancy is widely used in dependable systems design to ensure high reliability against soft errors. Conventional TMR is effective in protecting sequential circu...
Wei Chen, Rui Gong, Fang Liu, Kui Dai, Zhiying Wan...
EPK
2006
114views Management» more  EPK 2006»
15 years 5 months ago
Verifying Properties of (Timed) Event Driven Process Chains by Transformation to Hybrid Automata
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
Stefan Denne
AAI
2006
103views more  AAI 2006»
15 years 4 months ago
A generic time management service for distributed multi-agent systems
Multi-agent systems are well suited for building large software systems. A great deal of these complex systems includes process flows that are concerned with time or are even time...
Lars Braubach, Alexander Pokahr, Winfried Lamersdo...