Sciweavers

3946 search results - page 487 / 790
» The computational complexity of choice sets
Sort
View
DATE
2006
IEEE
143views Hardware» more  DATE 2006»
16 years 25 days ago
A coverage metric for the validation of interacting processes
We present a coverage metric which evaluates the testing of a set of interacting concurrent processes. Existing behavioral coverage metrics focus almost exclusively on the testing...
Ian G. Harris
ICDM
2006
IEEE
146views Data Mining» more  ICDM 2006»
16 years 25 days ago
Boosting Kernel Models for Regression
This paper proposes a general boosting framework for combining multiple kernel models in the context of both classification and regression problems. Our main approach is built on...
Ping Sun, Xin Yao
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
16 years 23 days ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
ACRI
2006
Springer
16 years 23 days ago
On Spiral Glider-Guns in Hexagonal Cellular Automata: Activator-Inhibitor Paradigm
We present a cellular-automaton model of a reaction-diffusion excitable system with concentration dependent inhibition of the activator, and study the dynamics of mobile localiza...
Andrew Wuensche
MSR
2006
ACM
16 years 22 days ago
Mining eclipse for cross-cutting concerns
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
Silvia Breu, Thomas Zimmermann, Christian Lindig