16404 search results - page 686 / 3281 » A set coverage problem |
212
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
200
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
168
click to vote
RE
1999
Springer
15 years 11 months ago
1999
Springer
One of the difficulties in requirements negotiation is to determine a feasible and mutually satisfactory set of requirements for the developer and the user, a problem related to C...
179
click to vote
HICSS
2010
IEEE
15 years 11 months ago
2010
IEEE
Service oriented device architecture (SODA) is a promising approach for overcoming interoperability issues and especially for extending the IT support of business processes to dev...
194
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...