Sciweavers

1723 search results - page 130 / 345
» Cycling in linear programming problems
Sort
View
VLSID
2007
IEEE
126views VLSI» more  VLSID 2007»
15 years 10 months ago
An ECO Technique for Removing Crosstalk Violations in Clock Networks
Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix cros...
Amit Kumar, Krishnendu Chakrabarty, Chunduri Rama ...
LPNMR
2001
Springer
15 years 2 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
AAAI
2008
15 years 11 days ago
Efficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
Esra Erdem, Ferhan Türe
EMO
2005
Springer
126views Optimization» more  EMO 2005»
15 years 3 months ago
The Evolution of Optimality: De Novo Programming
Abstract. Evolutionary algorithms have been quite effective in dealing with single-objective “optimization” while the area of Evolutionary Multiobjective Optimization (EMOO) h...
Milan Zeleny
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
14 years 10 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte