Sciweavers

2214 search results - page 233 / 443
» complexity 2004
Sort
View
COMGEO
2004
ACM
15 years 4 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
CONNECTION
2004
117views more  CONNECTION 2004»
15 years 4 months ago
Structure and function of evolved neuro-controllers for autonomous robots
The Artificial Life approach to Evolutionary Robotics is used as a fundamental framework for the development of a modular neural control of autonomous mobile robots. The applied e...
Martin Hülse, Steffen Wischmann, Frank Pasema...
CORR
2004
Springer
107views Education» more  CORR 2004»
15 years 4 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune
CORR
2004
Springer
86views Education» more  CORR 2004»
15 years 4 months ago
Pandora : une plate-forme efficace pour la construction d'applications autonomes
Autonomic computing has been proposed recently as a way to address the difficult management of applications whose complexity is constantly increasing. Autonomous applications will ...
Simon Patarin, Mesaac Makpangou
CONCUR
2011
Springer
14 years 4 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...