2254 search results - page 118 / 451 » Computing the minimal covering set |
107
click to vote
AMAI
1999
Springer
15 years 14 days ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
102
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
101
Voted
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
As robots and humans move towards sharing the same environment, the need for safety in robotic systems is of growing importance. Towards this goal of human-friendly robotics, a rob...
149
click to vote
JSSPP
2010
Springer
14 years 10 months ago
2010
Springer
Cluster computing is excellent for parallel computation. It has become increasingly popular. In cluster computing, a service level agreement (SLA) is a set of quality of services (...
114
Voted
PERCOM
2006
ACM
16 years 11 days ago
2006
ACM
We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors...