Sciweavers

1819 search results - page 8 / 364
» Performance Evaluation of Demodulation Methods: a Combinator...
Sort
View
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 27 days ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
COMPSAC
2005
IEEE
14 years 1 months ago
An Empirical Performance Study for Validating a Performance Analysis Approach: PSIM
Performance analysis gains more attention in recent years by researchers who focus their study on the early software development stages to mitigate the risk of redesign as problem...
Jinchun Xia, Yujia Ge, Carl K. Chang
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 7 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
SIGCOMM
2012
ACM
11 years 9 months ago
ShadowStream: performance evaluation as a capability in production internet live streaming networks
As live streaming networks grow in scale and complexity, they are becoming increasingly difficult to evaluate. Existing evaluation methods including lab/testbed testing, simulati...
Chen Tian, Richard Alimi, Yang Richard Yang, David...