Sciweavers

2526 search results - page 20 / 506
» A New Algorithm for Answer Set Computation
Sort
View
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
13 years 9 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 9 months ago
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
ICCV
2005
IEEE
14 years 11 months ago
A Robust Algorithm for Point Set Registration Using Mixture of Gaussians
This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented...
Bing Jian, Baba C. Vemuri
KRDB
2003
111views Database» more  KRDB 2003»
13 years 10 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
ALIFE
1999
13 years 8 months ago
An Approach to Biological Computation: Unicellular Core-Memory Creatures Evolved Using Genetic Algorithms
A novel machine language genetic programming system that uses one-dimensional core memories is proposed and simulated. The core is compared to a biochemical reaction space, and in ...
Hikeaki Suzuki