2899 search results - page 487 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
102
click to vote
ESTIMEDIA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract— This paper presents an exploration framework which performs data assignment and access scheduling exploration for applications given a multilayer memory architecture. O...
CEC
2003
IEEE
15 years 6 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
104
click to vote
ICCS
2003
Springer
15 years 6 months ago
2003
Springer
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
122
click to vote
CSMR
2009
IEEE
15 years 6 months ago
2009
IEEE
Creating accurate models of information systems is an important but challenging task. It is generally well understood that such modeling encompasses general scientific issues, bu...
106
click to vote
RTCSA
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...