Sciweavers

2861 search results - page 302 / 573
» Constraint Programming
Sort
View
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 7 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
ICASSP
2009
IEEE
16 years 1 months ago
A global optimization framework for meeting summarization
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...
Daniel Gillick, Korbinian Riedhammer, Benoît...
LOPSTR
2009
Springer
16 years 1 months ago
LP with Flexible Grouping and Aggregates Using Modes
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
Marcin Czenko, Sandro Etalle
PPSN
2004
Springer
15 years 12 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
ICTAI
2003
IEEE
15 years 12 months ago
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Benjamin W. Wah, Yixin Chen