Sciweavers

1603 search results - page 28 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 4 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
DIS
2010
Springer
14 years 12 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
170
Voted
EMO
2009
Springer
235views Optimization» more  EMO 2009»
15 years 8 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
TASE
2008
IEEE
15 years 1 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
DCC
1995
IEEE
15 years 5 months ago
Constrained-Storage Vector Quantization with a Universal Codebook
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
Sangeeta Ramakrishnan, Kenneth Rose, Allen Gersho