2370 search results - page 93 / 474 » The Characterization of Data-Accumulating Algorithms |
ECRTS
2006
IEEE
15 years 3 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
WG
2007
Springer
15 years 4 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
DCG
2002
14 years 9 months ago
2002
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Although the interest in nature-inspired optimization of dynamic problems has been growing constantly over the past decade, very little has been done to analyze and characterize a...
COLING
2000
14 years 11 months ago
2000
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...