2446 search results - page 434 / 490 » Choiceless Polynomial Time |
117
Voted
IJCAI
1993
15 years 5 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
138
Voted
ISMB
1994
15 years 5 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
130
Voted
AAAI
1990
15 years 5 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
148
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
134
Voted
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...