Sciweavers

16404 search results - page 472 / 3281
» A set coverage problem
Sort
View
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
15 years 10 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
EVOW
2008
Springer
15 years 8 months ago
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke,...
WSC
2004
15 years 8 months ago
Foundations of Validating Reusable Behavioral Models in Engineering Design Problems
We present a conceptual framework for validating reusable behavioral models. The setting for this work is a modern product development environment in which design is performed by ...
Richard J. Malak, Christiaan J. J. Paredis
ADCM
2008
111views more  ADCM 2008»
15 years 7 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 7 months ago
Pseudorandom generators and the BQP vs. PH problem
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...
Bill Fefferman, Christopher Umans