1298 search results - page 120 / 260 » The online set cover problem |
150
click to vote
FSTTCS
2007
Springer
16 years 19 days ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
180
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Gathering a large collection of images has been made quite easy by social and image sharing websites, e.g. flickr.com. However, using such collections faces the problem that they ...
189
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents an approach for classifying students in order to predict their final grade based on features extracted from logged data in an education web-based system. A comb...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
171
click to vote
TOCL
2011
15 years 1 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...