Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
487
Randomized versus Nondeterministic Communication Complexity
"... Our main result is the demonstration of a Boolean function f with nondeterministic and co-nondeterministic complexities O (log n) and c-error randomized complexity fl(log2 n), for O < c < 1/2. This is the first separation of this kind for a deci-sion problem. 1 ..."
Abstract
- Add to MetaCart
Our main result is the demonstration of a Boolean function f with nondeterministic and co-nondeterministic complexities O (log n) and c-error randomized complexity fl(log2 n), for O < c < 1/2. This is the first separation of this kind for a deci-sion problem. 1
performance analysis and controller synthesis for real-time systems
- In Fundamentals of Software Engineering
, 2010
"... This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling for-malism introduced by Alur and Dill [7,8]. The note gives comprehensive definitions of timed automata, priced (or weighted) timed automata, and timed games and highli ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
and highlights a number of results on associated deci-sion problems related to model checking, equivalence checking, optimal scheduling, and winning strategies.
Abstraction-based algorithm for 2QBF
- In Proc. 14th International Conference on Theory and Applications of Satisfiability Testing (SAT 2011
, 2011
"... Abstract. Quantified Boolean Formulas (QBFs) enable standard representation of PSPACE problems. In particular, formulas with two quantifier levels (2QBFs) enable representing problems in the second level of the polynomial hierarchy (ΠP2, ΣP2). This paper proposes an algorithm for solving 2QBF satisf ..."
Abstract
-
Cited by 17 (5 self)
- Add to MetaCart
satisfiability by counterexample guided abstraction refinement (CEGAR). This represents an alternative approach to 2QBF satisfiability and, by extension, to solving deci-sion problems in the second level of polynomial hierarchy. In addition, the paper presents a comparison of a prototype implementing
Logic-based preference languages with intermediate complexity
- in: Proceedings of the 4th Multidisciplinary Workshop on Advances in Preference Handling (MPREF-2008), (AAAI
, 2008
"... Logic-based preference representation languages are used to represent utility functions in combinatorial auctions, and can also be used for voting. A canonical problem in this con-text is, given a set of propositional formulas with associated weights, to find an assignment1 that maximizes the sum of ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
of those weights which are associated to satisfied formulas. The general case is intractable, and natural restrictions of the lan-guages tend either to leave the complexity unchanged or to reduce it to triviality. After proposing a revision of the deci-sion problem considered in existing research, we use a
Reactive Contro l of Dynamic Progressive Processing
"... Progressive processing is a model of computa-tion that allows a system to tradeoff computa-tional resources against the quality of results. This paper generalizes the'existing model to maice it suitable for dynamic composition of in-formation retrieval techniques. The new frame-work addresses e ..."
Abstract
- Add to MetaCart
effectively the uncertainty asso-ciated with the duration and output quality of each component. We show how to construct an optimal meta-level controller for a single task based on solving a corresponding Markov deci-sion problem, and how to extend the solution to the case of multiple and dynamic tasks using
On the complexity of dominating set problems related to the minimum all-ones problem
, 2006
"... The minimum all-ones problem and the connected odd dominating set problem were shown to be NP-complete in different papers for general graphs, while they are solvable in linear time (or trivial) for trees, uni-cyclic graphs, and series-parallel graphs. The complexity of both problems when restricted ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
restricted to bipartite graphs was raised as an open question. Here we solve both problems. For this purpose, we introduce the related deci-sion problem of the existence of an odd dominating set without isolated vertices, and study its complexity. Our main result shows that this new problem is NP
Open Access Application and Research of Improved AHP Model in Employment of College Students
"... Abstract: Employment is a problem faced by every fresh graduate. Graduates from different majors choose the right job according to their own situations. However, typically graduates would find it difficult to make judgments of jobs, thus missing out their most appropriate chances. In this paper, the ..."
Abstract
- Add to MetaCart
scheme used to resolve employment problems, and that it is viable to use the mathematical model to solve complex deci-sion problem in the real world. However, a more realistic model on the basis of large amounts of data should be con-structed in this paper, which is regretfully not built here given
An AHP Model for Construction Contractor
"... Given that contractor plays a critical role in any construction project, contractor selection con-stitutes key decision for public authorities. Prequalification, i.e. the elimination of incompetent contractors from the bidding process according to a predetermined set of criteria, is a fre-quently pr ..."
Abstract
- Add to MetaCart
amulticriteria decision making approach, based on the Analytic Hierar-chy Process (AHP), for supporting public authorities in contractor prequalification. The deci-sion problem is decomposed into qualitative criteria and sub-criteria that are further analyzed in quantitative indicators on which the candidate
1Chapter 9. Watershed Restoration— Adaptive Decision Making in the Face of Uncertainty
"... Strategies for restoring river ecosystems: sources of variability and uncertainty in natural and managed sys-tems. American Fisheries Society, Bethesda, Maryland. Abstract.—Decisions about watershed restoration projects often are complicated by compet-ing interests and goals, gaps in scientific know ..."
Abstract
- Add to MetaCart
makers, and the deci-sion problem itself. Because social concerns so often prevail in restoration decisions, we begin with a discussion of issues characterizing the social context. Next, in three increasingly broad contexts for watershed restoration, we discuss the application of several methods
Chance-Constrained Programming Method of IT Risk Countermeasures for Social Consensus Making
"... Abstract—The authors address a social consensus making support in discussing countermeasures for information technol-ogy risks (IT risks). For supporting stakeholders ’ discussion on which IT risk countermeasures the stakeholders should implement, experts of the risk management estimate parame-ter v ..."
Abstract
- Add to MetaCart
in their discussion. The authors propose a high-speed chance-constrained pro-gramming method by aggregating the constraints that are generated by approximation of the problem in the sample average method. By applying the proposed method to real deci-sion problems, the authors confirmed that computational time
Results 1 - 10
of
487
