Sciweavers

1278 search results - page 133 / 256
» The Complexity of Weighted Boolean
Sort
View
MST
2010
140views more  MST 2010»
13 years 8 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 10 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
BMCBI
2007
114views more  BMCBI 2007»
13 years 10 months ago
Combination of scoring schemes for protein docking
Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist o...
Philipp Heuser, Dietmar Schomburg
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
14 years 2 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
14 years 2 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang