Sciweavers

1941 search results - page 354 / 389
» On the Hardness of Approximate Reasoning
Sort
View
WSNA
2003
ACM
15 years 5 months 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
ATAL
2003
Springer
15 years 5 months ago
Distributing the control of a temporal network among multiple agents
Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. S...
Luke Hunsberger
AUSAI
2003
Springer
15 years 5 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
HYBRID
2010
Springer
15 years 5 months ago
Safe compositional network sketches: formal framework
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch assists system integr...
Azer Bestavros, Assaf J. Kfoury, Andrei Lapets, Mi...
IPSN
2010
Springer
15 years 5 months ago
Ear-phone: an end-to-end participatory urban noise mapping system
A noise map facilitates monitoring of environmental noise pollution in urban areas. It can raise citizen awareness of noise pollution levels, and aid in the development of mitigat...
Rajib Kumar Rana, Chun Tung Chou, Salil S. Kanhere...