Sciweavers

3406 search results - page 627 / 682
» Computational models of classical conditioning
Sort
View
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
13 years 6 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev

Publication
145views
13 years 4 months ago
Wireless Client Puzzles in IEEE 802.11 Networks: Security by Wireless
Resource-depletion attacks against IEEE 802.11 access points (APs) are commonly executed by flooding APs with fake authentication requests. Such attacks may exhaust an AP’s memor...
Ivan Martinovic, Frank A. Zdarsky, Matthias Wilhel...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 3 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
13 years 3 months ago
Distributed constrained optimization over noisy networks
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
Kunal Srivastava, Angelia Nedic, Dusan M. Stipanov...
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 3 months ago
Effective complexity of stationary process realizations
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
Nihat Ay, Markus Müller, Arleta Szkola