2446 search results - page 405 / 490 » Choiceless Polynomial Time |
ICALP
1999
Springer
14 years 2 hour ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
ICLP
1999
Springer
14 years 34 min ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
KR
1998
Springer
13 years 12 months ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
ACMICEC
2007
ACM
13 years 11 months ago
2007
ACM
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...