Sciweavers

105 search results - page 14 / 21
» On Semidefinite Programming Relaxations of the Traveling Sal...
Sort
View
AIR
2010
96views more  AIR 2010»
13 years 7 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
CDC
2008
IEEE
172views Control Systems» more  CDC 2008»
13 years 9 months ago
Convex relaxation approach to the identification of the Wiener-Hammerstein model
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 9 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
COLING
2010
13 years 2 months ago
Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
Hitoshi Nishikawa, Takaaki Hasegawa, Yoshihiro Mat...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 1 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz