Sciweavers

4903 search results - page 352 / 981
» The Set Covering Machine
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
COLING
2010
15 years 1 months ago
Simultaneous Ranking and Clustering of Sentences: A Reinforcement Approach to Multi-Document Summarization
Multi-document summarization aims to produce a concise summary that contains salient information from a set of source documents. In this field, sentence ranking has hitherto been ...
Xiaoyan Cai, Wenjie Li, Ouyang You, Hong Yan
FOCM
2011
113views more  FOCM 2011»
15 years 1 months ago
Finite Resolution Dynamics
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
Stefano Luzzatto, Pawel Pilarczyk
JCT
2011
74views more  JCT 2011»
15 years 1 months ago
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
Stefanie Frick, Stefan Geschke
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller