Sciweavers

13621 search results - page 274 / 2725
» Computability and Complexity in Self-assembly
Sort
View
ECP
1997
Springer
125views Robotics» more  ECP 1997»
15 years 10 months ago
Possibilistic Planning: Representation and Complexity
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
Célia da Costa Pereira, Frédé...
VR
2000
IEEE
114views Virtual Reality» more  VR 2000»
15 years 10 months ago
Virtual Fekete Point Configurations: A Case Study in Perturbing Complex Systems
Virtual environments have shown great promise as a research tool in science and engineering. In this paper we study a classical problem in mathematics: that of approximating globa...
Robert van Liere, Jurriaan D. Mulder, Jason Frank,...
ESANN
2003
15 years 8 months ago
Neural networks organizations to learn complex robotic functions
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
WSCG
2004
166views more  WSCG 2004»
15 years 8 months ago
Non-evaluated Manipulation of Complex CSG Solids
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
Rafael Jesús Segura, Francisco R. Feito, Ju...
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan