Sciweavers

886 search results - page 49 / 178
» Generalized Bezout Identity
Sort
View
IPCO
2001
125views Optimization» more  IPCO 2001»
13 years 10 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre
NIPS
2003
13 years 10 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 10 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
WSC
2000
13 years 10 months ago
Ranking and selection for steady-state simulation
We present and evaluate two ranking-and-selection procedures for use in steady-state simulation experiments when the goal is to find which among a finite number of alternative sys...
David Goldsman, William S. Marshall, Seong-Hee Kim...
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 9 months ago
Data-Oblivious Stream Productivity
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...
Jörg Endrullis, Clemens Grabmayer, Dimitri He...