67 search results - page 6 / 14 » Solving MAX-r-SAT Above a Tight Lower Bound |
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
INFORMATICALT
2010
13 years 5 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
ANOR
2005
13 years 6 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
GLOBECOM
2006
IEEE
14 years 23 days ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
CONSTRAINTS
2008
13 years 6 months ago
2008
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...