نتایج جستجو برای: case based tour finder

تعداد نتایج: 4039694  

2010
H. Safikhani S. A. Nourbakhsh N. Nariman-zadeh

Vortex finder is a key part of cyclone separator. In the present study, multi-objective optimization of vortex finder is performed at three steps. At the first step, collection efficiency (η) and the pressure drop (∆p) in a set of cyclones with different vortex finder shape are numerically investigated using CFD techniques. Two meta-models based on the evolved group method of data handling (GMD...

Journal: :Nord. J. Comput. 1999
Joachim Gudmundsson Christos Levcopoulos

In TSP with neighborhoods (TSPN) we are given a collection X of k polygonal regions, called neighborhoods, with totally n vertices, and we seek the shortest tour that visits each neighborhood. The Euclidean TSP is a special case of the TSPN problem, so TSPN is also NP-hard. In this paper we present a simple and fast algorithm that, given a start point, computes a TSPN tour of length O(log k) ti...

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

2007
Christoph W. Kessler

This paper introduces the Weight Finder, an advanced profiler for Fortran programs,which is based on a von Neumann architecture. Existing Fortran codes are generally too large toanalyze fully in depth with respect to performance tuning. It is the responsibility of the WeightFinder to detect the most important regions of code in the program, as far as execution time isconcerned. ...

2012
Christoph W. Kessler

This paper introduces the Weight Finder, an advanced profiler for Fortran programs,which is based on a von Neumann architecture. Existing Fortran codes are generally too large toanalyze fully in depth with respect to performance tuning. It is the responsibility of the WeightFinder to detect the most important regions of code in the program, as far as execution time isconcerned. ...

Journal: :Nature 1989

2010
Jasmin Christian Blanchette

Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based firstorder relational model finder. Nitpick supports unbounded quantification, (co)inductive predicates and datatypes, and (co)recursive functions. Fundamentally a finite model finder, it approximates infinite types by finite subsets. Our experimental results on Isabelle theories and the TPTP library indic...

2005
Andrew Cohen Michael J. Mazzeo

This paper analyzes the relationship between the competitive environment faced by depository institutions and the decisions these institutions make regarding the size of their branch networks. Specifically, we consider branches as a sunk investment that potentially increases utility for consumers and examine how local competition and product differentiation affect firms’ decisions regarding whe...

2012
Mark Broadie Richard J. Rendleman

Golf is a global sport with professional golfers playing on many organized tours throughout the world. The largest and most important tours for male professionals include the PGA Tour, European Tour, Japanese Tour and Asian Tour. The Official World Golf Ranking, or OWGR, is a system for ranking male professional golfers on a single scale. We say a ranking system is unbiased if otherwise identic...

Journal: :Journal of Korean Institute of Intelligent Systems 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید