Sciweavers

5331 search results - page 72 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICC
2008
IEEE
118views Communications» more  ICC 2008»
15 years 4 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
ISSRE
2003
IEEE
15 years 3 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
14 years 11 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
WCE
2007
14 years 11 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
EOR
2006
74views more  EOR 2006»
14 years 9 months ago
A mixed-integer programming approach to multi-class data classification problem
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...
Fadime Üney Yüksektepe, Metin Türka...