• No results found

Effective Search Method for More Constraints Problem

A Scatter Search Method for Fuzzy Job Shop Scheduling Problem with Availability Constraints

A Scatter Search Method for Fuzzy Job Shop Scheduling Problem with Availability Constraints

... scatter search method is proposed to solve the fuzzy job shop scheduling problem with availability ...SS method is compared with a HGA ...SS method is obtained the best value for ...

5

Indexing Methods for Faster and More Effective Person Name Search

Indexing Methods for Faster and More Effective Person Name Search

... a more effective but slower name comparison ...faster search, some of the methods evaluated here led to modest gains in effectiveness by eliminating false ...exhaustive search and increased F1 ...

5

An effective placement method for the single container loading problem

An effective placement method for the single container loading problem

... loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is ...the problem under study is ...

27

Tabu search method for solving multiobjective job shop scheduling problem

Tabu search method for solving multiobjective job shop scheduling problem

... or more goals or we can call it objectives that need to be fulfilled at the end of ...Scheduling problem can be modelled as an assignment problem which indicates a large class of combinatorial ...

28

More effective randomized search heuristics for graph coloring through dynamic optimization

More effective randomized search heuristics for graph coloring through dynamic optimization

... � ≥ 3 [ 8]. Furthermore, even if the input graph � is promised to be 3-colorable, it is N P-hard to color � with 4 colors [ 9]. We examine a dynamic variant of the graph coloring problem in bipartite graphs where ...

10

An effective hybrid local search approach for the post enrolment course timetabling problem

An effective hybrid local search approach for the post enrolment course timetabling problem

... Timetabling problem involves the placement of resources in time and space in such a way to optimize utilization and sat- isfy stakeholders’ ...this problem include sports timetabling, educational ...

33

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

... generate more attractive feasible placement, all the VM types are enumerated, and on each VM type, a subproblem needs to be solved : given a VM type k and a set W k of workers whose resource demands will not ...

9

Solving the problem of constraints due to Dirichlet boundary conditions in the context of the mini element method.

Solving the problem of constraints due to Dirichlet boundary conditions in the context of the mini element method.

... element method from the classical finite element method is that the latter do not present such additional independent ...The method of mixed finite elements is effective for certain problems ...

10

Less is more approach: basic variable neighborhood search for the obnoxious p-median problem

Less is more approach: basic variable neighborhood search for the obnoxious p-median problem

... Medium 6 6 35 43 45 3 Large 1 1 9 46 40 1 All 16 23 92 137 133 4 From the reported results, we may infer that the proposed approach yet quite simple clearly outperforms existing single-thread state-of-the-art approaches, ...

14

Methodologies and Approaches in ELT: A Search for More Effective Ways of Teaching Second/ Foreign Languages

Methodologies and Approaches in ELT: A Search for More Effective Ways of Teaching Second/ Foreign Languages

... and more importantly the applied linguists to introduce new approaches or methods to attain their ...most effective method or approach among the existing ones and then they try to launch a new one ...

7

A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem

A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem

... optimization problem of locating a good approximation to the global optimum of a given function in a relatively large search ...The method is often implemented when the search space is ...

6

A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph

A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph

... For each TSP instance, two vertices are randomly selected firstly as the terminal vertices. Then an approximate OP n is computed with the improved GA. In this way, total n OP n s are computed for computing an FG. Then, ...

12

Search times with arbitrary detection constraints

Search times with arbitrary detection constraints

... foraging, search processes, and many other situations in ...n-passage problem, with n being ...detection problem for arbitrary dimensions and arbitrary detection ...the effective detection ...

9

FastVC Search is more effective than H-search when finding a representative set of connections quickly is more important than finding a larger set of connections slowly

FastVC Search is more effective than H-search when finding a representative set of connections quickly is more important than finding a larger set of connections slowly

... Manuscript prepared February, 2014. method in state-of-the-art Hex players. The strength gains are significant. In §II we review the rules of Hex and the algebra of computing connection strategies. In §III we ...

11

Review of Travelling Salesmen Problem through Lexi Search Method
Nabeel Naeem Hasan

Review of Travelling Salesmen Problem through Lexi Search Method Nabeel Naeem Hasan

... lexicographic search was found to be more efficient than the Branch bound ...The problem of mathematical programming is to find the maximum or minimum of an objective function whose variables are ...

11

New variable neighborhood search method for minimum sum coloring problem on simple graphs

New variable neighborhood search method for minimum sum coloring problem on simple graphs

... local search procedure may be induced to cycle between two or more locally optimal solutions and leading to search ...has more interruptions for holding of the other vertices and increase ...

17

The Search Problem in Mixture Models

The Search Problem in Mixture Models

... and method of moments: A common method for learning mixture models is the EM algorithm of Dempster et ...in method-of-moments estimators for mixture ...of more Gaussians, but constrained to ...

61

More Effective Web Search Using Bigrams and Trigrams

More Effective Web Search Using Bigrams and Trigrams

... extraction problem and present an extraction algorithm that shows promising results when applied to real-time web ...augmented search software package that can leverage the results provided by a web ...

15

Native Cardinality Constraints: More Expressive, More Efficient Constraints

Native Cardinality Constraints: More Expressive, More Efficient Constraints

... cardinality constraints are translated, or en- coded, into SAT which significantly increase the time and space complexity of the original formula, which can be avoided by reasoning about them natively within the ...

21

Effective Method for Retrieval of Information and Relational Database by Keyword Search Mechanism

Effective Method for Retrieval of Information and Relational Database by Keyword Search Mechanism

... Our examination demonstrates that these elements have very little effect on execution. In outline, our work affirms before claims in regards to the unsuitable execution of these frameworks and underscores the requirement ...

7

Show all 10000 documents...

Related subjects