Sciweavers

4451 search results - page 325 / 891
» On Random Ordering Constraints
Sort
View
JUCS
2008
153views more  JUCS 2008»
15 years 6 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
TASE
2008
IEEE
15 years 6 months ago
Design of Stochastic Distribution Networks Using Lagrangian Relaxation
This paper addresses the design of single commodity stochastic distribution networks. The distribution network under consideration consists of a single supplier serving a set of re...
Guy-Aimé Tanonkou, Lyès Benyoucef, X...

Publication
69views
15 years 6 months ago
Fun-Sort--or the chaos of unordered binary search
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
CORR
2002
Springer
132views Education» more  CORR 2002»
15 years 6 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
15 years 4 months ago
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
Sergey Ioffe