Sciweavers

2286 search results - page 202 / 458
» Algorithms for Categorical Equivalence
Sort
View
AISC
2006
Springer
15 years 10 months ago
A New Definition for Passivity and Its Relation to Coherence
It is an essential step in decomposition algorithms for radical differential ideals to satisfy the so-called Rosenfeld property. Basically all approaches to achieve this step are ...
Moritz Minzlaff, Jacques Calmet
GD
2006
Springer
15 years 10 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
AUSAI
2001
Springer
15 years 10 months ago
A Memetic Pareto Evolutionary Approach to Artificial Neural Networks
Evolutionary Artificial Neural Networks (EANN) have been a focus of research in the areas of Evolutionary Algorithms (EA) and Artificial Neural Networks (ANN) for the last decade. ...
Hussein A. Abbass
AAAI
2004
15 years 8 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
IJCAI
2003
15 years 8 months ago
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
James Bowen, Chavalit Likitvivatanavong