نتایج جستجو برای: bui

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

1997
Ian P. Gent Toby Walsh

Abs t rac t At the heart of many optimizat ion procedures are powerful pruning and propagation rules. This paper presents a case study in the construction of such rules. We develop a new algor i thm, Complete Decreasing Best F i t , that finds the opt imal packing of objects into bins. The algor i thm use a branching rule based on the well known Decreasing Best Fi t approximat ion algor i thm. ...

Journal: :Pattern Recognition Letters 1991
Sankar K. Pal Azriel Rosenfeld

Pal, S.K. and A. Rosenfeld, A fuzzy medial axis transformation based on fuzzy disks, Pattern Recognition Letters 12 (1991) 585-590. A fuzzy disk with cenler P is a fuzzy set in which membership depends only on distance from P. For any fuzzy set 1. there is a maximal fuzzy disk g~ ~j centered al every point P, and j is the sup of the g~'s. (Moreover, if j is fuzzy convex, so is every g~, bUI nOl...

2008
Ha H. Bui K. Sako

The finite element method (FEM) is often used as the conventional method in computational geomechanics. However, dealing with the large deformation and failure is generally a difficult task for FEM since this method is suffered from grid distortions. In order to resolve this problem, the development of smoothed particle hydrodynamics (SPH) to simulate large deformation and failure of geomateria...

Journal: :Computers & Graphics 1996
Donald McManus Carl J. Beckmann

Designers of computer graphics hardware have used increasing device counts available from IC manufacturers to increase parallelism using techniques such as putting a longer pipeline of data path elements on integrated circuits. or developing designs which use an array of processors. Pixel-Planes 1-5 and PixelFIow l are examples of architectures which use an array of pixel processors for rasteri...

1971
J. C. Simon C. Roche

Analogies between Pattern Recogn i t ion and St ati stacal Communication Theory are pointed out. With the relat ive entropy between the "ideal a t t r i ­ bute" and "heuristic at t r ibute" sets as an index of performance, optimum selection of possible heur i s t i c operators resuJ ts in a recognition deci­ sion in probabi l i t ty , with t he smallest possi ble average number of tests during ...

2011
C. MAROBELA-RABOROKGWE

MAROBELA·RABOROKGWE. C., NICHOlAS, R. , AYLING , R. & BASHIRUOOIN, J .S. 2003. Comparison of complement fixation test, Irrmunoblotting, indirect ELISA, and compelitive ELISA for detecting antibodies to Mycoplasma mycoldes subspecies mycokJes small colony (SC) in naturally Infected cattle from the 1995 outbreak in Botswana. Onderstepoort Journal of veterinary Research, 70:21 27 Four serological ...

2009

The aim of this paper is to compare different metaheuristics for the graph bisection problem. For this purpose, the Bui and Moon’s genetic algorithm adaptation for graph bisection is used. A second genetic algorithm adaptation for graph bisection is also presented. These algorithms are compared to an implementation of the iterated local search metaheuristic for graph bisection. All these metahe...

Journal: :The Journal of bone and joint surgery. American volume 2011
James B Ames Peter J Millett

T he pathoanatomy of anterior shoulder dislocations has been well documented. Perthes described an anterior labral lesion as early as 1906, and Bankart wrote his classic article on recurrent anterior dislocations more than seventy years ago. Until recently, much less had been written about posterior shoulder instability; to our knowledge, the first case series was reported by Reeves in 1963. Re...

Journal: :CoRR 2013
Sang-il Oum Sigve Hortemo Sæther Martin Vatshelle

Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a kexpression, Dominating Set can be solved in 4knO(1) time. However, no FPT algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a (23k − 1)expression via rank-width and then solving Dominatin...

Journal: :Theor. Comput. Sci. 2014
Sang-il Oum Sigve Hortemo Sæther Martin Vatshelle

Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a kexpression, Dominating Set can be solved in 4knO(1) time. However, no FPT algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a (23k − 1)expression via rank-width and then solving Dominatin...

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

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