5263 search results - page 586 / 1053 » Open Constraint Optimization |
194
click to vote
TCS
2008
15 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
191
click to vote
TKDE
2008
15 years 7 months ago
2008
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
175
click to vote
CCR
2005
15 years 7 months ago
2005
Internet data remains one of the basic components of computer science network research. Despite its necessity, available data is limited by legal, social, and technical constraint...
147
click to vote
ANOR
2002
15 years 7 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
196
click to vote
CGF
2004
15 years 7 months ago
2004
The navigation activity is an every day practice for any human being capable of locomotion. Our objective in this work is to reproduce this crucial human activity inside virtual e...