1300 search results - page 80 / 260 » Constraint satisfaction problems and global cardinality cons... |
97
Voted
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
KBS
2007
14 years 10 months ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
ICCBR
2003
Springer
15 years 3 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
86
Voted
ADHOCNOW
2008
Springer
15 years 4 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...