Sciweavers

1568 search results - page 182 / 314
» The problem of examination questions in algorithmics
Sort
View
ICIP
2003
IEEE
16 years 8 months ago
Robust line detection using a weighted MSE estimator
In this paper we introduce a novel line detection algorithm based on a weighted minimum mean square error (MSE) formulation. This algorithm has been developed to enable an autonom...
Guido M. Schuster, Aggelos K. Katsaggelos
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
16 years 3 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 29 days ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 11 months ago
Investigating whether hyperNEAT produces modular neural networks
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
Jeff Clune, Benjamin E. Beckmann, Philip K. McKinl...
ATAL
2003
Springer
15 years 11 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...