Sciweavers

379 search results - page 44 / 76
» Strong reducibility of partial numberings
Sort
View
BPM
2009
Springer
116views Business» more  BPM 2009»
14 years 4 months ago
Discovering Reference Models by Mining Process Variants Using a Heuristic Approach
Abstract. Recently, a new generation of adaptive Process-Aware Information Systems (PAISs) has emerged, which enables structural process changes during runtime. Such flexibility, ...
Chen Li, Manfred Reichert, Andreas Wombacher
MFCS
2009
Springer
14 years 4 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He
GLVLSI
2007
IEEE
134views VLSI» more  GLVLSI 2007»
14 years 4 months ago
Sleep transistor distribution in row-based MTCMOS designs
- The Multi-Threshold CMOS (MTCMOS) technology has become a popular technique for standby power reduction. This technology utilizes high-Vth sleep transistors to reduce subthreshol...
Chanseok Hwang, Peng Rong, Massoud Pedram
ICCS
2007
Springer
14 years 3 months ago
Providing Fault-Tolerance in Unreliable Grid Systems Through Adaptive Checkpointing and Replication
Abstract. As grids typically consist of autonomously managed subsystems with strongly varying resources, fault-tolerance forms an important aspect of the scheduling process of appl...
Maria Chtepen, Filip H. A. Claeys, Bart Dhoedt, Fi...
IEEEARES
2006
IEEE
14 years 3 months ago
No Risk is Unsafe: Simulated Results on Dependability of Complementary Currencies
Efforts have been put for electronization of complementary currencies (alternative forms of monetary media) in the hope that it would reduce their operational cost. However, this ...
Kenji Saito, Eiichi Morino, Jun Murai