1204 search results - page 188 / 241 » Termination of Polynomial Programs |
158
click to vote
IJCAI
2007
15 years 7 months ago
2007
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
172
click to vote
CCCG
2003
15 years 7 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....
137
click to vote
AAAI
1998
15 years 7 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...
183
click to vote
CONSTRAINTS
2008
15 years 5 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
158
Voted
DEDS
2010
15 years 5 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...