Sciweavers

1274 search results - page 90 / 255
» N-fold integer programming
Sort
View
EACL
2009
ACL Anthology
15 years 5 days ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
ISBRA
2010
Springer
15 years 9 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
CP
2005
Springer
15 years 8 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
ISLPED
1998
ACM
79views Hardware» more  ISLPED 1998»
15 years 6 months ago
Voltage scheduling problem for dynamically variable voltage processors
This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is also proposed and for...
Tohru Ishihara, Hiroto Yasuura
DAM
2010
120views more  DAM 2010»
15 years 2 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren