Sciweavers

2397 search results - page 6 / 480
» Applications of integer relation algorithms
Sort
View
DAM
2000
97views more  DAM 2000»
13 years 9 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
14 years 2 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
TWC
2008
158views more  TWC 2008»
13 years 9 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
MOR
2002
94views more  MOR 2002»
13 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 10 months ago
Divisibility, Smoothness and Cryptographic Applications
This paper deals with products of moderate-size primes, familiarly known as smooth numbers. Smooth numbers play an crucial role in information theory, signal processing and crypto...
David Naccache, Igor Shparlinski