Sciweavers

14386 search results - page 255 / 2878
» The Chinese Generals Problem
Sort
View
ECAI
2000
Springer
15 years 9 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
FSTTCS
2006
Springer
15 years 8 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
FSTTCS
1991
Springer
15 years 8 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
FLAIRS
2006
15 years 6 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
AAAI
1994
15 years 6 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...