14165 search results - page 655 / 2833 » The generalized two-server problem |
177
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
149
click to vote
AMC
2010
15 years 7 months ago
2010
The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
196
click to vote
AUTOMATICA
2007
15 years 7 months ago
2007
The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous....
198
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
162
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...