2430 search results - page 302 / 486 » Computing Tutte Polynomials |
134
click to vote
AIPS
2006
15 years 5 months ago
2006
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
145
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
154
click to vote
CCCG
2003
15 years 5 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
125
click to vote
IJCAI
2003
15 years 5 months ago
2003
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
112
click to vote
AAAI
1998
15 years 5 months ago
1998
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...