Sciweavers

1977 search results - page 47 / 396
» The satisfactory partition problem
Sort
View
FOCI
2007
IEEE
16 years 7 days ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...
DAM
1999
88views more  DAM 1999»
15 years 5 months ago
Separable Partitions
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Noga Alon, Shmuel Onn
TNN
1998
76views more  TNN 1998»
15 years 5 months ago
Multiobjective genetic algorithm partitioning for hierarchical learning of high-dimensional pattern spaces: a learning-follows-d
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
Rajeev Kumar, Peter Rockett
149
Voted
AMCS
2010
146views Mathematics» more  AMCS 2010»
15 years 6 months ago
Sensor network design for the estimation of spatially distributed processes
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
Dariusz Ucinski, Maciej Patan
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner