Sciweavers

2976 search results - page 263 / 596
» On the bounded integer programming
Sort
View
144
Voted
SIAMJO
2002
87views more  SIAMJO 2002»
15 years 4 months ago
An Optimization Approach for Radiosurgery Treatment Planning
We outline a new approach for radiosurgery treatment planning, based on solving a series of optimization problems. We consider a specific treatment planning problem for a speciali...
Michael C. Ferris, Jinho Lim, David M. Shepard
132
Voted
JAIR
2010
99views more  JAIR 2010»
15 years 3 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
113
Voted
COLING
2010
15 years 22 hour ago
A Comparative Study on Ranking and Selection Strategies for Multi-Document Summarization
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
Feng Jin, Minlie Huang, Xiaoyan Zhu
EMNLP
2011
14 years 4 months ago
Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
Yin-Wen Chang, Michael Collins
130
Voted
COR
2006
98views more  COR 2006»
15 years 5 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve