Sciweavers

3678 search results - page 9 / 736
» On the Stable Paths Problem
Sort
View
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
14 years 4 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 3 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
CP
2006
Springer
13 years 11 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
IJCNN
2000
IEEE
14 years 2 months ago
Using Hopfield Networks to Solve Traveling Salesman Problems Based on Stable State Analysis Technique
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
Gang Feng, Christos Douligeris
BC
2006
105views more  BC 2006»
13 years 10 months ago
A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks
Recruitment learning in hierarchies is an inherently unstable process (Valiant, 1994). This paper presents conditions on parameters for a feedforward network to ensure stable recru...
Cengiz Günay, Anthony S. Maida