Sciweavers

881 search results - page 35 / 177
» Solving satisfiability problems with preferences
Sort
View
ENTCS
2006
118views more  ENTCS 2006»
13 years 8 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
NETWORKS
2007
13 years 8 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
EUSFLAT
2009
145views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
Valued Constraint Satisfaction Problems Applied to Functional Harmony
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
Nele Verbiest, Chris Cornelis, Yvan Saeys
ICDE
2010
IEEE
241views Database» more  ICDE 2010»
14 years 8 months ago
FlexPref: A Framework for Extensible Preference Evaluation in Database Systems
Personalized database systems give users answers tailored to their personal preferences. While numerous preference evaluation methods for databases have been proposed (e.g., skylin...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
PATAT
2004
Springer
130views Education» more  PATAT 2004»
14 years 2 months ago
Learning User Preferences in Distributed Calendar Scheduling
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
Jean Oh, Stephen F. Smith