Sciweavers

1300 search results - page 170 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
NIPS
2004
14 years 11 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
ANOR
2005
89views more  ANOR 2005»
14 years 9 months ago
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
Sangbum Lee, Ignacio E. Grossmann
GLOBECOM
2009
IEEE
15 years 4 months ago
Joint Power Control and Beamforming Codebook Design for MISO Channels with Limited Feedback
Abstract— This paper investigates the joint design and optimization of the power control and beamforming codebooks for the single-user multiple-input single-output (MISO) wireles...
Behrouz Khoshnevis, Wei Yu
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
14 years 20 days ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
ICAL
2011
301views more  ICAL 2011»
13 years 9 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...