Sciweavers

16404 search results - page 633 / 3281
» A set coverage problem
Sort
View
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
15 years 7 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
WSNA
2003
ACM
16 years 12 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
EDM
2008
97views Data Mining» more  EDM 2008»
15 years 8 months ago
Using Item-type Performance Covariance to Improve the Skill Model of an Existing Tutor
Using data from an existing pre-algebra computer-based tutor, we analyzed the covariance of item-types with the goal of describing a more effective way to assign skill labels to it...
Philip I. Pavlik, Hao Cen, Lili Wu, Kenneth R. Koe...
ATAL
2010
Springer
15 years 8 months ago
Deception in networks of mobile sensing agents
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...
Viliam Lisý, Roie Zivan, Katia P. Sycara, M...
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 7 months ago
Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
George T. Amariucai, Shuangqing Wei