4903 search results - page 296 / 981 » The Set Covering Machine |
167
Voted
DEBU
2010
15 years 6 months ago
2010
Much research has been conducted on the management of outdoor moving objects. In contrast, relatively little research has been conducted on indoor moving objects. The indoor setti...
184
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...
177
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...
197
Voted
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
155
click to vote
IOR
2002
15 years 6 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...