14548 search results - page 18 / 2910 » The Optimal Path-Matching Problem |
DEDS
2002
13 years 9 months ago
2002
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cos...
STOC
2012
ACM
12 years 9 days ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
PPSN
2010
Springer
13 years 8 months ago
2010
Springer
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
TPDS
2002
13 years 9 months ago
2002
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...