1477 search results - page 171 / 296 » Complexity of (iterated) dominance |
155
click to vote
ICC
2007
IEEE
16 years 23 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
151
click to vote
COMPSAC
2002
IEEE
15 years 11 months ago
2002
IEEE
Achievement of quality in software design, while never easy, is made more difficult by the inherent complexity of hard real-time (HRT) design. Furthermore, timing requirements in...
184
click to vote
ASC
2008
15 years 6 months ago
2008
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
159
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
205
click to vote
IS
2008
15 years 6 months ago
2008
In this paper we propose DFL -- a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the ...