Sciweavers

2905 search results - page 248 / 581
» Formal Memetic Algorithms
Sort
View
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
15 years 5 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
ICDCS
2006
IEEE
15 years 5 months ago
Computing in the Presence of Timing Failures
Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints...
Gadi Taubenfeld
INFOCOM
2006
IEEE
15 years 5 months ago
Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks
— The inherent trade-off between energy-efficiency and rapidity of event dissemination is characteristic for wireless sensor networks. Scarcity of energy renders it necessary fo...
Thomas Moscibroda, Pascal von Rickenbach, Roger Wa...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 5 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang
ISCAS
2006
IEEE
103views Hardware» more  ISCAS 2006»
15 years 5 months ago
Towards autonomous adaptive behavior in a bio-inspired CNN-controlled robot
— This paper describes a general approach for the unsupervised learning of behaviors in a behavior-based robot. The key idea is to formalize a behavior produced by a Motor Map dr...
Paolo Arena, Luigi Fortuna, Mattia Frasca, Luca Pa...