Sciweavers

690 search results - page 66 / 138
» Multi-Agent Only Knowing
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
ADHOCNOW
2007
Springer
14 years 2 months ago
Information Brokerage Via Location-Free Double Rulings
The in-network aggregation and processing of information is what sets a sensor network apart from a pure data acquisition device. One way to model the exchange of information betwe...
Stefan Funke, Imran Rauf
AIED
2007
Springer
14 years 2 months ago
Accelerated Future Learning via Explicit Instruction of a Problem Solving Strategy
Explicit instruction in a problem-solving strategy accelerated learning not only in the domain where it was taught but also in a second domain where it was not taught. We present d...
Min Chi, Kurt VanLehn
CIVR
2007
Springer
199views Image Analysis» more  CIVR 2007»
14 years 2 months ago
New local descriptors based on dissociated dipoles
This paper describes new local photometric descriptors based on dissociated dipoles for transformed images or rigid objects retrieval. Dissociated dipoles are non local different...
Alexis Joly
CSL
2007
Springer
14 years 2 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart