Sciweavers

3656 search results - page 279 / 732
» Compact Location Problems
Sort
View
INFORMATICALT
2000
104views more  INFORMATICALT 2000»
15 years 6 months ago
Nonlinear Stochastic Optimization by the Monte-Carlo Method
Methods for solving stochastic optimization problems by Monte-Carlo simulation are considered. The stoping and accuracy of the solutions is treated in a statistical manner, testing...
Leonidas Sakalauskas
MP
2002
85views more  MP 2002»
15 years 6 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
GIS
2010
ACM
15 years 5 months ago
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
Maike Buchin, Anne Driemel, Marc J. van Kreveld, V...
MIG
2010
Springer
15 years 5 months ago
Path Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...
CORR
2011
Springer
140views Education» more  CORR 2011»
14 years 10 months ago
Bias-Driven Revision of Logical Domain Theories
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
Ronen Feldman, Moshe Koppel, Alberto Maria Segre