Sciweavers

48 search results - page 7 / 10
» Note on MAX 2SAT
Sort
View
CSR
2007
Springer
14 years 1 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
CPAIOR
2006
Springer
13 years 11 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
CHI
2009
ACM
14 years 8 months ago
Note to self: examining personal information keeping in a lightweight note-taking tool
This paper describes a longitudinal field experiment in personal note-taking that examines how people capture and use information in short textual notes. Study participants used o...
Max Van Kleek, Michael S. Bernstein, Katrina Panov...
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
RECOMB
2005
Springer
14 years 7 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal