Sciweavers

2183 search results - page 106 / 437
» Multi-pass geometric algorithms
Sort
View
EVOW
2006
Springer
14 years 1 months ago
A Multiagent Algorithm for Graph Partitioning
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
Francesc Comellas, Emili Sapena
ESA
2003
Springer
123views Algorithms» more  ESA 2003»
14 years 3 months ago
Experiments on Graph Clustering Algorithms
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
Ulrik Brandes, Marco Gaertler, Dorothea Wagner
INFOCOM
2005
IEEE
14 years 3 months ago
Power control for OSNR optimization in optical networks: a distributed algorithm via a central cost approach
— This paper addresses the problem of optical signal-to-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general multi-lin...
L. Pavel
CA
2000
IEEE
14 years 2 months ago
Algorithms for Generating Motion Trajectories Described by Prepositions
A list of representative directional prepositions of the English language is investigated to develop computation models that output some general motion trajectory or goal directio...
Yilun Dianna Xu, Norman I. Badler
AAAI
2006
13 years 11 months ago
Algorithms for Control and Interaction of Large Formations of Robots
NSF and NASA sponsored a workshop to discuss harvesting solar power in space. One solution considered was the use of a swarm of robots to form a solar reflector. How can these rob...
Ross Mead, Jerry B. Weinberg