1225 search results - page 84 / 245 » The Instance Complexity Conjecture |
CP
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
AI
2007
Springer
14 years 3 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
TGC
2007
Springer
14 years 3 months ago
2007
Springer
Web service instances are often replicated to allow service provision to scale to support larger population sizes of users. However, such systems are difficult to analyse because t...
IJCNN
2006
IEEE
14 years 3 months ago
2006
IEEE
— Previously we have shown that chaos can arise in networks of physically realistic neurons [1], [2]. Those networks contain a moderate to large number of units connected in a sp...
ACMSE
2006
ACM
14 years 3 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...