Sciweavers

539 search results - page 20 / 108
» An Improved Upper Bound for SAT
Sort
View
GLVLSI
1996
IEEE
126views VLSI» more  GLVLSI 1996»
13 years 11 months ago
An Accurate Interconnection Length Estimation for Computer Logic
Important layout properties of electronic designs include space requirements and interconnection lengths. A reliable interconnection length estimation is essential for improving p...
Dirk Stroobandt, Herwig Van Marck, Jan Van Campenh...
ALGORITHMICA
2010
88views more  ALGORITHMICA 2010»
13 years 7 months ago
Improved Bounds for Wireless Localization
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
DM
2008
55views more  DM 2008»
13 years 7 months ago
Improved pebbling bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
Melody Chan, Anant P. Godbole
JCSS
2008
80views more  JCSS 2008»
13 years 7 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
DCC
2006
IEEE
14 years 7 months ago
Asymptotic Nonlinearity of Boolean Functions
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
François Rodier