randomly generated problem instances
A Study on North East Corner Method in Transportation Problem of Operations Research and using of Object Oriented Programming Model
... many randomly generated problem instances ...big problem of Transportation problem using Object oriented programming in Java and develop a NEM in Java Flowchart, Algorithm, ...
6
Conjugacy Separation Problem in Braids: an Attack on the Original Colored Burau Key Agreement Protocol
... of randomly generated instances of the conjugacy separation problem of length twice as long as originally proposed can be broken in less than two hours by a heuristic algorithm that operates ...
17
The effect of temporary links in randomly generated networks of constraints
... Another experiment is done for networks with n=15 agents, p1=0.4 (medium constraint networks ) where the tightness value p2 varies between 0.1 and 0.9 to cover all ranges of problem difficulty. This aimed to test ...
13
Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
... routing problem with fuzzy demand (MOMC- ...demand generated randomly are ...on randomly generated instances in which the required edges have demand for two commodities (data set ...
22
Learning from text and images: generative and discriminative models for partially labeled data
... inverse problem : instead of modeling the visual world as in computer graphics, computer vision attempts to solve the problem of identifying the properties (such as shape, brightness, segmentation) from ...
123
Due dates for the Taillard’s Benchmark adapted to the parallel flow shop scheduling problem and best solutions
... been generated according to an uniform distribution between [α·LB, β·LB], being α=1-T-R/2 and β=-T+R/2 as was defined in (Potts and Van Wassenhove, 1982), where T and R are the tardiness factor of jobs and ...
263
Converting Declarative Rules into Decision Trees
... specific problem use examples of data instances in the decision tree generation ...data instances rather than from the data instances ...
7
Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem
... BDMST Problem is given by Achuthan and Caccetta in ...BDMST problem which achieve extremely tight LP bounds (within 1% of the optimal solution for almost all bench- marks ...BDMST instances of up to ...
12
On regularity and the word problem for free idempotent generated semigroups
... word problem for RIG(E ), with E finite, is soluble if and only if all the maximal subgroups have soluble word problems (this follows directly from [35, Theorem ...
33
Toward a Pattern-Based Release Planning
... is generated using parameters and instances and various experiences of that step instead of creating different states in every ...are generated for parameter instances in release planning but ...
5
Ranking the Best Instances
... ranking problem under the AUC crite- rion could be interpreted as a classification problem with pairs of observations (Cl ´emenc¸on et ...weight instances according to their rank (J¨arvelin and ...
29
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
... Abstract— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET pro- tection is gradually being removed because of its high cost (while SONET framing is kept for failure ...
11
36. {ME, MA, MD, MI, MN, MO, MS, MT, TX, LA, AL,
... Possible answer: In each iteration, the midpoints of the segments or the centers of the quadrilaterals are moved a randomly. generated amount,[r] ...
38
i-TEE – An Image Encryption Algorithm based on Multilevel Encryption using a Randomly Generated Bitmap Image
... the randomly generated bitmap image and encryption based on the key from the partial portion of the randomly generated ...the randomly generated image makes a brute-force attack ...
6
Towards a Universal SMILES representation - A standard method to generate canonical SMILES based on the InChI
... The SMILES format is the most popular line notation in use today. Created by David Weininger in 1986 at the US Environmental Research Laboratory (USEPA), and further developed at the company he co-founded, Day- light ...
14
Weak Instances of PLWE
... Lattice-based cryptography has been an active area of study for at least two decades. The Ajtai-Dwork [AD99] public-key cryptosystem was based on the worst-case hardness of a variant of the Shortest Vector Problem ...
12
Energy Detection Technique in Cognitive Radio System
... Abstract — Energy detection is one of the spectrum sensing techniques in cognitive radio system that facilitate to detect vacancies in spectrum frequency. Energy detection also denoted as non-coherent detection is the ...
5
Automated design of genetic programming of classification algorithms.
... Two problem domains, namely cybersecurity and financial forecasting were selected to evaluate the effectiveness of automated design when applied on instances from a single problem ...this ...
161
Optimal NetFlow Deployment in IP Networks
... the problem of deploying NetFlow with optimized cov- erage and cost in an IP ...Location Problem (ONLP) for a given coverage ...the problem as an Integer Linear Program ...The problem and the ...
10
Finding Patterns in Noisy Crowds: Regression based Annotation Aggregation for Crowdsourced Data
... In this work, our contributions are as follows: (1) we develop a regression-based method for au- tomatically aggregating crowdsourced annotations of varying quality, with poor agreement and mini- mal expert-adjudicated ...
6