Sciweavers

16404 search results - page 819 / 3281
» A set coverage problem
Sort
View
CP
2005
Springer
16 years 1 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
16 years 1 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
ECML
2004
Springer
16 years 29 days ago
Learning from Message Pairs for Automatic Email Answering
Abstract. We consider the problem of learning a mapping from question to answer messages. The training data for this problem consist of pairs of messages that have been received an...
Steffen Bickel, Tobias Scheffer
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
16 years 28 days ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
LPNMR
2004
Springer
16 years 28 days ago
Planning with Preferences Using Logic Programming
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
Tran Cao Son, Enrico Pontelli