4233 search results - page 330 / 847 » Three Paths to Effectiveness |
230
click to vote
ESA
2003
Springer
16 years 16 hour ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
174
Voted
ICSE
2010
IEEE-ACM
15 years 11 months ago
2010
IEEE-ACM
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
194
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
This paper proposes a spiking neural network (SNN) of the mammalian auditory midbrain to achieve binaural multiple sound source localisation. The network is inspired by neurophysio...
177
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
We describe a framework for the automatic synthesis of biped locomotion controllers that adapt to uneven terrain at run-time. The framework consists of two components: a per-foots...
223
click to vote
KBSE
2000
IEEE
15 years 11 months ago
2000
IEEE
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...