3600 search results - page 185 / 720 » The settling-time reducibility ordering |
171
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
167
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
150
click to vote
COLING
1992
15 years 7 months ago
1992
This paper describes the syntactic rules which are applied in the Japanese speech recognition module of a speech-to-speech translation system. Japanese is considered to be a free ...
143
click to vote
AML
2010
15 years 6 months ago
2010
We investigate and extend the notion of a good approximation with respect to the enumeration (De) and singleton (Ds) degrees. We refine two results by Griffith, on the inversion of...
163
click to vote
IJCSA
2007
15 years 6 months ago
2007
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...