Sciweavers

13987 search results - page 405 / 2798
» The Two Guards Problem
Sort
View
CORR
2008
Springer
151views Education» more  CORR 2008»
15 years 7 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
183
Voted
JGO
2008
83views more  JGO 2008»
15 years 6 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner
JAR
2006
106views more  JAR 2006»
15 years 6 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
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 6 months ago
Hybrid state estimation: a target tracking application
In this paper we present a framework in which the general hybrid filtering or state estimation problem can be formulated. The problem of joint tracking and classification can be f...
Yvo Boers, Hans Driessen
CORR
2004
Springer
168views Education» more  CORR 2004»
15 years 6 months ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham