CN
2010
13 years 5 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
FLAIRS
2004
13 years 6 months ago
2004
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
ICRA
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper we consider the problem of exploring an unknown environment by a team of robots. As in single-robot exploration the goal is to minimize the overall exploration time....
BIOADIT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Simple linear readouts from generic neural microcircuit models can be trained to generate and control basic movements, e.g., reaching with an arm to various target points...
ECRTS
2008
IEEE
13 years 11 months ago
2008
IEEE
The commonly used task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Within these windows, execut...