989 search results - page 40 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
CCE
2005
13 years 7 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
GECCO
2010
Springer
14 years 20 days ago
2010
Springer
We have acquired panelist data that provides hedonic (liking) ratings for a set of 40 flavors each composed of the same 7 ingredients at different concentration levels. Our goal...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
We analyse scenarios in which self-interested agents negotiate with each other in order to agree on deals to exchange resources. We consider two variants of the framework, one whe...