photo

ime sem


strasbourg

自 2013 起处于活动状态

Followers: 0   Following: 0

消息

myriam
Professional Interests: informatique et mathematique

统计学

  • Thankful Level 1

查看徽章

Feeds

排序方式:

提问


i need application of automatic speech recognition using genetic algorithm
automatic speech recognition

10 years 前 | 0 个回答 | 0

0

个回答

提问


HELLO,i need an application for A speech recognition.thanks
application for A speech recognition

10 years 前 | 0 个回答 | 0

0

个回答

提问


help me to draw a cube
points (0,0,0) (0,0,50) (0,50,0) (0,50,50) (50,0,0) (50,0,50) (50,50,0) (50,50,50)

10 years 前 | 1 个回答 | 0

1

个回答

提问


plotting the number of actions for ex i=i+1 ( action), pgd=n/i ( action), pgd=n(action)
function pgd = entier(n) i = 2; while i≤n/2 & mod(n,i)~-0 i = i+1; end if mod(n,i)==0 pg...

10 years 前 | 1 个回答 | 0

1

个回答

提问


can you help me to calculate the number of multiplication and operation ,we used flops,
function i = pdga() n=46; factors = factor(n); if length(factors) == 1 i = 1; else i = pro...

10 years 前 | 1 个回答 | 0

1

个回答

提问


can you help me to ploting the number of operations and time of execution
function pgdA n=1000; i=45; while mod(n, i)~=0; i=i-1; end flops mod(n,i); plot mod(n,i);

10 years 前 | 1 个回答 | 0

1

个回答

提问


how plotting the number of operation of this algorithm ,we use flops
function pgd = pgdd(~) n=1000; i = 2; while i<= sqrt(n) && mod(n,i)~=0 i = i+1; end if mod(n,i)~=0 pg...

10 years 前 | 0 个回答 | 0

0

个回答

提问


can you help me to ploting the number of operations we use flops
function pgd = pgdd(~) n=1000; i = 2; while i<= sqrt(n) && mod(n,i)~=0 i = i+1; end if mod(n,i)~=0 ...

10 years 前 | 1 个回答 | 0

1

个回答

提问


help me for calculate the number of operation ,for ex( i:=i+1)operation.
L'algorithme: fonction pgd (n:entier) var i:entier debut i:=2 tanque(i<=n/2 et(n mod i)!0 faire i:=i+1 finta...

10 years 前 | 0 个回答 | 0

0

个回答

提问


can you help me to program tree of knuth and calculate numbers of operation
6=3+3 3=2+1 2=1+1

11 years 前 | 0 个回答 | 0

0

个回答

提问


can you help me to program algorithm of tree
tree of this numbers 4 7 15 9

11 years 前 | 0 个回答 | 0

0

个回答

提问


can you help me to programming method of tree of knuth,i need the plot of number of multiplication
2=1+1 3=2+1 6=3+3 x^2:1 x^2*x:1 x^3*x^3:1

11 years 前 | 0 个回答 | 0

0

个回答

提问


can you help me to programming algorithm of tree and calculate the numbers of actions
ex 4 7 13 5 0

11 years 前 | 0 个回答 | 0

0

个回答

提问


plotting the number of multiplication
i=1:1000, n=i*i, plot(n)

11 years 前 | 1 个回答 | 0

1

个回答

提问


can you help me turn this algorithm to matlab and plotting the number of earring
fonction pgd n:entier; var i debut i=2 tantque i≤n/2 et (n mod i)#0 faire i=i+1 fintantque si (n mod i)=0 alors pgd=n div...

11 years 前 | 1 个回答 | 0

1

个回答

提问


can you help me to programming method of tree of knuth
2=1+1 3=2+1 6=3+3 x^2:1 x^2*x:1 x^3*x^3:1

11 years 前 | 1 个回答 | 0

1

个回答

提问


faire le plot du nombre du boucle pour n assez grand ,le plot pour le nombre d'operation,le plot du temp d'execution
function i = pdga(n) factors = factor(n); if length(factors) == 1 i = 1; else i = prod(factors(2:...

11 years 前 | 0 个回答 | 0

0

个回答

提问


programmer la méthode naîve Yn=x^n;Yn=x*x*x..... n fois;ecrire n sous forme binaire,remplacer chaque n par '1':par les lettres'SX',et '0'par les lettres'S'.eliminer la paire'SX'la plus à gauche.résultat=x^n
example: n=(23)de la basse 10 n=(10111) de la basse 2 n=10111 n=SXSSXSXSX, S:square , X :multiplication pour X....

11 years 前 | 0 个回答 | 0

0

个回答