Sciweavers

1197 search results - page 94 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CGF
2000
97views more  CGF 2000»
13 years 8 months ago
Motion Balance Filtering
This paper presents a new technique called motion balance filtering, which corrects an unbalanced motion to a balanced one while preserving the original motion characteristics as ...
Seyoon Tak, Oh-Young Song, Hyeong-Seok Ko
PODS
2002
ACM
167views Database» more  PODS 2002»
14 years 8 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
PC
2002
118views Management» more  PC 2002»
13 years 8 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
EOR
2008
75views more  EOR 2008»
13 years 8 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
ATAL
2007
Springer
14 years 2 months ago
Estimating information value in collaborative multi-agent planning systems
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
David Sarne, Barbara J. Grosz