Sciweavers

292 search results - page 12 / 59
» Are Stable Instances Easy
Sort
View
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 2 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
102
Voted
ATAL
2009
Springer
15 years 7 months ago
Stable multi-project scheduling of airport ground handling services by heterogeneous agents
This paper addresses decentralized multi-project scheduling under uncertainty. The problem instance we study is the scheduling of airport ground handling services, where aircraft ...
Xiaoyu Mao, Nico Roos, Alfons H. Salden
ECAI
2010
Springer
14 years 11 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
IJCAI
2003
15 years 2 months ago
Logic Programs for Consistently Querying Data Integration Systems
We solve the problem of obtaining answers to queries posed to a mediated integration system un­ der the local-as-view paradigm that are consistent wrt to certain global integrity...
Loreto Bravo, Leopoldo E. Bertossi
131
Voted
JAIR
2002
182views more  JAIR 2002»
15 years 11 days ago
An Analysis of Phase Transition in NK Landscapes
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
Yong Gao, Joseph C. Culberson