Sciweavers

3495 search results - page 270 / 699
» On the random satisfiable process
Sort
View
DSD
2006
IEEE
116views Hardware» more  DSD 2006»
16 years 1 months ago
Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems*
In this paper we present an approach for the mapping optimization of fault-tolerant embedded systems for safetycritical applications. Processes and messages are statically schedul...
Viacheslav Izosimov, Paul Pop, Petru Eles, Zebo Pe...
ICLP
2003
Springer
16 years 14 days ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
16 years 6 days ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
ICA3PP
2010
Springer
16 years 2 days ago
On-Line Task Granularity Adaptation for Dynamic Grid Applications
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
Nithiapidary Muthuvelu, Ian Chai, Eswaran Chikkann...
JCST
2008
114views more  JCST 2008»
15 years 7 months ago
Synthesizing Service Composition Models on the Basis of Temporal Business Rules
Transformational approaches to generating design and implementation models from requirements can bring effectiveness and quality to software development. In this paper we present a...
Jian Yu, Yanbo Han, Jun Han, Yan Jin, Paolo Falcar...