Sciweavers

9719 search results - page 151 / 1944
» Answer Set Optimization
Sort
View
205
Voted
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 2 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang
112
Voted
DIS
2010
Springer
14 years 10 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...
73
Voted
EOR
2008
162views more  EOR 2008»
15 years 26 days ago
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Given arbitrary source and target nodes s, t and an s
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chr&...
ICALP
1998
Springer
15 years 5 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
AICT
2008
IEEE
15 years 2 months ago
Towards Efficient Service Placement and Server Selection for Large-Scale Deployments
Currently many service providers offer their services using a private and proprietary hard- and software infrastructure. These infrastructures often share many similarities. Hence...
Jeroen Famaey, Tim Wauters, Filip De Turck, Bart D...