Sciweavers

859 search results - page 170 / 172
» Behaviour Analysis of Distributed Systems Using the Tracta A...
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
EDBTW
2010
Springer
14 years 22 days ago
ODBIS: towards a platform for on-demand business intelligence services
In recent years, Software-as-a-Service (SaaS) is gaining momentum with more and more successful adoptions. Several companies including some well known names have embraced this new...
Moez Essaidi
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 13 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
JSA
2000
115views more  JSA 2000»
13 years 7 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
14 years 8 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...