1298 search results - page 151 / 260 » The online set cover problem |
154
click to vote
PARELEC
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
200
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
206
click to vote
ALENEX
2001
15 years 7 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
142
click to vote
CSR
2007
Springer
16 years 20 days ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
156
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...