Join Our Newsletter

CORR

2012

Springer

7 years 9 months ago
2012

Springer

Most theoretical deﬁnitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...

ESA

2011

Springer

8 years 1 months ago
2011

Springer

Back in 1995, Alt and Godau gave an eﬃcient algorithm for deciding whether a given curve resembles some part of a larger curve under a ﬁxed Fr´echet distance, achieving a runn...

CORR

2011

Springer

8 years 8 months ago
2011

Springer

The value 1 problem is a decision problem for probabilistic automata on ﬁnite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...

TON

2002

9 years 1 months ago
2002

The existing telecommunications infrastructure in most of the world is adequate to deliver voice and text applications, but demand for broadband services such as streaming video an...

IPL

1998

9 years 1 months ago
1998

Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...

JAR

2006

9 years 1 months ago
2006

In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...

AML

2006

9 years 1 months ago
2006

Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...

COR

2010

9 years 1 months ago
2010

The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...

UAI

1998

9 years 2 months ago
1998

This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...

SODA

2003

ACM

9 years 2 months ago
2003

ACM

With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...