Sciweavers

4047 search results - page 396 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
15 years 12 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
ICFCA
2009
Springer
15 years 11 months ago
A Novel Approach to Cell Formation
We present an approach to the cell formation problem, known from group technology, which is inspired by formal concept analysis. The cell formation problem consists in allocating p...
Radim Belohlávek, Niranjan Kulkarni, Vil&ea...
INFOCOM
1997
IEEE
15 years 11 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 8 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
161
Voted
DAM
2008
115views more  DAM 2008»
15 years 6 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey