Sciweavers

48 search results - page 6 / 10
» Note on MAX 2SAT
Sort
View
JSAT
2006
114views more  JSAT 2006»
13 years 7 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
DAM
2008
111views more  DAM 2008»
13 years 7 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule

Lecture Notes
1759views
15 years 5 months ago
Single-Person and Multi-Person Decision Theory
These lecture notes cover several topics such as Abstract Preferences and Choices, A Choice Structure Approach to Consumer Demand, A Preference Based Approach to Consumer Demand P...
Max Stinchcombe
ENDM
2008
82views more  ENDM 2008»
13 years 7 months ago
Finding Folkman Numbers via MAX CUT Problem
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
Andrzej Dudek, Vojtech Rödl
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 1 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee