Sciweavers

65 search results - page 8 / 13
» On Optimal Solutions for the Bottleneck Tower of Hanoi Probl...
Sort
View
EMO
2006
Springer
87views Optimization» more  EMO 2006»
13 years 11 months ago
Symbolic Archive Representation for a Fast Nondominance Test
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
Martin Lukasiewycz, Michael Glaß, Christian ...
SBACPAD
2003
IEEE
103views Hardware» more  SBACPAD 2003»
14 years 24 days ago
Profiling and Optimization of Software-Based Network-Analysis Applications
A large set of tools for network monitoring and accounting, security, traffic analysis and prediction — more broadly, for network operation and management — require direct and...
Loris Degioanni, Mario Baldi, Fulvio Risso, Gianlu...
TIT
2008
92views more  TIT 2008»
13 years 7 months ago
Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
Chao Tian, Jun Chen
SCHOLARPEDIA
2011
12 years 10 months ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer