Sciweavers

7311 search results - page 133 / 1463
» Time in State Machines
Sort
View
CODES
1998
IEEE
15 years 8 months ago
Optimistic distributed timed cosimulation based on thread simulation model
In this paper, we present thread-based optimistic distributed timed cosimulation methods which reduce the overhead of optimistic simulation. First, we present thread simulation mo...
Sungjoo Yoo, Kiyoung Choi
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 8 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 8 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
IWMM
2010
Springer
118views Hardware» more  IWMM 2010»
15 years 9 months ago
Speculative parallelization using state separation and multiple value prediction
With the availability of chip multiprocessor (CMP) and simultaneous multithreading (SMT) machines, extracting thread level parallelism from a sequential program has become crucial...
Chen Tian, Min Feng, Rajiv Gupta
ICCAD
2001
IEEE
89views Hardware» more  ICCAD 2001»
16 years 1 months ago
Sequential SPFDs
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
Subarnarekha Sinha, Andreas Kuehlmann, Robert K. B...