601 search results - page 44 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
151
click to vote
STDBM
2004
Springer
15 years 6 months ago
2004
Springer
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
111
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
118
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
120
click to vote
CONSTRAINTS
2007
15 years 1 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
119
click to vote
ACL
2011
14 years 5 months ago
2011
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...