Sciweavers

216 search results - page 32 / 44
» Edge Search Number of Cographs in Linear Time
Sort
View
IJCAI
2003
13 years 9 months ago
DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks
We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate ...
Austin I. Eliazar, Ronald Parr
JGAA
2002
86views more  JGAA 2002»
13 years 7 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
NN
2000
Springer
192views Neural Networks» more  NN 2000»
13 years 7 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
ICTAI
2010
IEEE
13 years 5 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
Una Benlic, Jin-Kao Hao
PODC
2011
ACM
12 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer