1632 search results - page 197 / 327 » Sublinear Time Algorithms for Metric Space Problems |
156
click to vote
TON
2008
15 years 4 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
140
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
145
click to vote
AAAI
1997
15 years 5 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
107
click to vote
IFIP
1994
Springer
15 years 8 months ago
1994
Springer
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
125
click to vote
CCCG
2008
15 years 5 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...