Sciweavers

5263 search results - page 1038 / 1053
» Open Constraint Optimization
Sort
View
AAAI
2000
15 years 1 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
WSCG
2003
167views more  WSCG 2003»
15 years 1 months ago
Vector-valued Image Restoration with Applications to Magnetic Resonance Velocity Imaging
The analysis of blood flow patterns and the interaction between salient topological flow features and cardiovascular structure plays an important role in the study of cardiovascul...
Yin-Heung Pauline Ng, Guang-Zhong Yang
121
Voted
UAI
1997
15 years 1 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
ATAL
2010
Springer
15 years 26 days ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
ACMDIS
2010
ACM
14 years 12 months ago
Incorporating user control in automated interactive scheduling systems
In this paper, we report our findings on the impact of providing users with varying degrees of control in an automated interactive scheduling system. While automated scheduling te...
Jina Huh, Martha E. Pollack, Hadi Katebi, Karem A....
« Prev « First page 1038 / 1053 Last » Next »