Sciweavers

2272 search results - page 159 / 455
» Capture Complexity by Partition
Sort
View
IPPS
2010
IEEE
15 years 1 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
CORR
2009
Springer
74views Education» more  CORR 2009»
15 years 1 months ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
INFORMATICALT
2010
118views more  INFORMATICALT 2010»
15 years 16 days ago
Facilitating Ontology Development with Continuous Evaluation
In this paper we propose facilitating ontology development by constant evaluation of steps in the process of ontology development. Existing methodologies for ontology development a...
Dejan Lavbic, Marjan Krisper
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 10 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
TCOM
2011
114views more  TCOM 2011»
14 years 10 months ago
Iterative Receivers Based on Subblock Processing for Phase Noise Compensation in OFDM Systems
—An iterative algorithm employing decision feedback provided by either an equalizer or a channel decoder is proposed in order to compensate for the phase noise resulting from imp...
Myung-Kyu Lee, Kyeongcheol Yang, Kyungwhoon Cheun