Sciweavers

5372 search results - page 406 / 1075
» complexity 2007
Sort
View
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 7 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
AGILEDC
2007
IEEE
16 years 1 months ago
On the Sustained Use of a Test-Driven Development Practice at IBM
Test-Driven Development (TDD) is an agile practice that is widely accepted and advocated by most agile methods and methodologists. In this paper, we report on a post hoc analysis ...
Julio Cesar Sanchez, Laurie A. Williams, E. Michae...
ICRA
2007
IEEE
128views Robotics» more  ICRA 2007»
16 years 1 months ago
Adaptive Play Q-Learning with Initial Heuristic Approximation
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
Andriy Burkov, Brahim Chaib-draa
IEEEICCI
2007
IEEE
16 years 1 months ago
Underwater surface recovery and segmentation
Abstract— The underwater environment presents many challenges for robotic sensing including highly variable lighting and the presence of dynamic objects such as fish and suspend...
Michael R. M. Jenkin, Andrew Hogue, Andrew German,...
ATAL
2007
Springer
16 years 29 days ago
Diagnosis of plan step errors and plan structure violations
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to...
Cees Witteveen, Nico Roos, Adriaan ter Mors, Xiaoy...