• No results found

depth first heuristic algorithm

Machine Learning Based Heuristic Search Algorithms to Solve Birds of a Feather Card Game

Machine Learning Based Heuristic Search Algorithms to Solve Birds of a Feather Card Game

... algorithms. Depth-first search (DFS) and breadth-first search (BFS) are two rudi- mentary approaches to tree traversal that are straightforward to implement and can solve the game if ...as ...

6

The Keywords of the Depth of the First Encoding Data on Greedy Algorithm Nube

The Keywords of the Depth of the First Encoding Data on Greedy Algorithm Nube

... The security analysis above shows that the BDMRS scheme can protect the Index Confidentiality and Query Confidentiality in the known ciphertext model. However, the cloud server is able to link the same search requests by ...

11

Download
			
			
				Download PDF

Download Download PDF

... namely depth first search, breadth first search, best first search, hill-climbing and the A* ...evolutionary algorithm hyper-heuristic is implemented for this purpose and its ...

13

Best-first heuristic search for multicore machines

Best-first heuristic search for multicore machines

... (a depth level is fully expanded, some maximum list size is reached (Stern & Dill, 1998), ...DDD algorithm used a breadth-first frontier search and therefore only the previous depth-layer ...

56

Keywords Depth of the First Data in the Greedy Algorithm Coding Nube

Keywords Depth of the First Data in the Greedy Algorithm Coding Nube

... The security analysis above shows that the BDMRS scheme can protect the Index Confidentiality and Query Confidentiality in the known ciphertext model. However, the cloud server is able to link the same search requests by ...

11

A Heuristic Search Algorithm for Flow-Shop Scheduling

A Heuristic Search Algorithm for Flow-Shop Scheduling

... the first two machines and the sequence of jobs is the same on the last two machines ...an algorithm (IHSA * ) which is guaranteed to find an optimal solution for flow-shop scheduling problems involving an ...

12

Enhanced Heuristic Teaching Timetabling Algorithm Using Genetic Algorithm

Enhanced Heuristic Teaching Timetabling Algorithm Using Genetic Algorithm

... The algorithm incorporates several operators (selection, crossover, muta tion) to enhance search efficiency and also ensure that the best chromosomes that are ...genetic algorithm was tested and compared ...

11

SOME NOVEL METHODS FOR FLOW SHOP SCHEDULING

SOME NOVEL METHODS FOR FLOW SHOP SCHEDULING

... The reason for genetic algorithms success at a wide and ever growing range of scheduling problems is a combination of power and exibility. The power derives from the empirically proven ability of evolutionary algorithms ...

9

Multikeyword Ranked Search Scheme Using Greedy Depth First Algorithm on Encrypted Cloud Data

Multikeyword Ranked Search Scheme Using Greedy Depth First Algorithm on Encrypted Cloud Data

... Searchable encryption schemes enable the clients to store the encrypted data to the cloud and execute keyword search over ciphertext domain. Due to different cryptography primitives, searchable encryption schemes can be ...

11

Optimum Design of Steel Structures in Accordance with AISC 2010 Specification Using Heuristic Algorithm

Optimum Design of Steel Structures in Accordance with AISC 2010 Specification Using Heuristic Algorithm

... The ELM requires that the second-order analysis, either the rigorous second order or amplified first-order analysis, be performed. The method is limited by two conditions (1) the structure supports gravity loads ...

12

Rate allocation for layered multicast streaming with inter-layer network coding

Rate allocation for layered multicast streaming with inter-layer network coding

... Min-Req algorithm does not require decoding at interior nodes but since it propagates minimum max-flow values, its per- formance in topologies where receivers have heterogeneous max-flow values may be ...Min-Cut ...

5

A novel coordinated resource provisioning approach for cooperative cloud market

A novel coordinated resource provisioning approach for cooperative cloud market

... the first to propose the vision of a market oriented cloud and provided a high level architecture for supporting market-oriented resource management for trading services among cloud providers and consumers, bound ...

17

Statistical Delay QoS Driven Energy Efficiency and Effective Capacity Tradeoff for Uplink Multi User Multi Carrier Systems

Statistical Delay QoS Driven Energy Efficiency and Effective Capacity Tradeoff for Uplink Multi User Multi Carrier Systems

... transmission power of femtocell base stations was minimized. A general power consumption model in multi-user OFDMA systems, including the transmission power, signal processing power, and circuit power from both the ...

15

 INFORMATION TECHNOLOGY GOVERNANCE USING COBIT 4 0 DOMAIN DELIVERY SUPPORT 
AND MONITORING EVALUATION

 INFORMATION TECHNOLOGY GOVERNANCE USING COBIT 4 0 DOMAIN DELIVERY SUPPORT AND MONITORING EVALUATION

... other heuristic modifier approaches tested on Toronto benchmark ...the first study to employ the concept of heuristic modifier within examination timetabling ...

12

Multi Objectives heuristic Algorithm for Grid Computing

Multi Objectives heuristic Algorithm for Grid Computing

... using heuristic algorithms. Several heuristic algorithms have been proposed in the literature, and they are either not efficient or ...Objectives heuristic Algorithm to minimize the makespan ...

7

Local Search Heuristics for NFA State Minimization Problem

Local Search Heuristics for NFA State Minimization Problem

... We have implemented the proposed NFA minimization methods in the ReFaM project. ReFaM (Rational Ex- pressions and Finite Automata Minimization) is a part of the HeO (Heuristic Optimization) library. This library ...

6

Lecture3 Heuristic

Lecture3 Heuristic

... path) to the solution in the minimum number of steps possible (no optimal algorithm can do better given the same heuristic). • An admissible heuristic is one that never overestimate[r] ...

44

A Cost sensitive Decision Tree Optimized Algorithm Based on Adaptive Mechanism

A Cost sensitive Decision Tree Optimized Algorithm Based on Adaptive Mechanism

... Design of the Cost-sensitive Decision Tree Algorithm Based on Adaptive Mechanism Determination of Optimal Heuristic Function In this paper, the heuristic function of CS-C4.5 is improved [r] ...

6

aPaRT: A Fast Meta-Heuristic Algorithm using Path-Relinking and Tabu Search for Allocating Machines to Operations in FJSP Problem

aPaRT: A Fast Meta-Heuristic Algorithm using Path-Relinking and Tabu Search for Allocating Machines to Operations in FJSP Problem

... search algorithm that solves the flexible job-shop scheduling (FJSP) problem to minimize ...proposed algorithm uses a path-relinking method to generate near optimal ...A heuristic parameter, α, is ...

13

Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks

Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks

... (6) The method of weighted residual energy of the next node, for a better distribution of energy is ultimately intended to increase the lifetime of the network. Also consider the distance between two nodes, thereby ...

8

Show all 10000 documents...

Related subjects