680 search results - page 8 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
IJAR
2006
13 years 7 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
KR
2004
Springer
14 years 1 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
FOIKS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
ACMSE
2000
ACM
14 years 4 days ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
AMC
2007
13 years 8 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...