2412 search results - page 339 / 483 » Which Problems Have Strongly Exponential Complexity |
CP
2005
Springer
14 years 3 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
SIGSOFT
2000
ACM
14 years 2 months ago
2000
ACM
Exception handling mechanisms are intended to help developers build robust systems. Although an exception handling mechanism provides a basis for structuring source code dealing w...
FASE
2000
Springer
14 years 1 months ago
2000
Springer
The problem of consistently engineering large, complex software systems of today is often addressed by introducing new, "improved" models. Examples of such models are arc...
WSC
2004
13 years 11 months ago
2004
Increased complexity of simulation models and the related modeling needs for global supply chains have necessitated the execution of simulations on multiple processors. While dist...