Sciweavers

284 search results - page 8 / 57
» What Matchings Can Be Stable
Sort
View
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
14 years 2 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
STACS
2012
Springer
12 years 4 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
CVPR
2003
IEEE
14 years 10 months ago
Fusing Online and Offline Information for Stable 3D Tracking in Real-Time
We propose an efficient online real-time solution for singlecamera 3?D tracking of rigid objects that can handle large camera displacements, drastic aspect changes, and partial oc...
Luca Vacchetti, Vincent Lepetit, Pascal Fua
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
JLP
2000
134views more  JLP 2000»
13 years 8 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole