Sciweavers

Share
CORR
2012
Springer
193views Education» more  CORR 2012»
7 years 9 months ago
Search versus Decision for Election Manipulation Problems
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis M...
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
8 years 1 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
CORR
2011
Springer
171views Education» more  CORR 2011»
8 years 8 months ago
A Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Ou...
TON
2002
116views more  TON 2002»
9 years 1 months ago
Managing capacity for telecommunications networks under uncertainty
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...
Yann d'Halluin, Peter A. Forsyth, Kenneth R. Vetza...
IPL
1998
95views more  IPL 1998»
9 years 1 months ago
A Variation on the Zero-One Law
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...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
JAR
2006
106views more  JAR 2006»
9 years 1 months ago
Some Computational Aspects of distance-sat
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...
Olivier Bailleux, Pierre Marquis
AML
2006
103views more  AML 2006»
9 years 1 months ago
Decision methods for linearly ordered Heyting algebras
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;...
Roy Dyckhoff, Sara Negri
COR
2010
123views more  COR 2010»
9 years 1 months ago
Multi-dimensional bin packing problems with guillotine constraints
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 ...
Rasmus Resen Amossen, David Pisinger
UAI
1998
9 years 2 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
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...
Ronald Parr
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
9 years 2 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
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...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
books