Sciweavers

2084 search results - page 369 / 417
» Set Constraints in Logic Programming
Sort
View
COR
2008
99views more  COR 2008»
13 years 8 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
JCST
2008
114views more  JCST 2008»
13 years 8 months ago
Synthesizing Service Composition Models on the Basis of Temporal Business Rules
Transformational approaches to generating design and implementation models from requirements can bring effectiveness and quality to software development. In this paper we present a...
Jian Yu, Yanbo Han, Jun Han, Yan Jin, Paolo Falcar...
CCE
2004
13 years 7 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 7 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
JMLR
2012
11 years 10 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre