-
/* a.out.h
Copyright 1997, 1998, 1999, 2001 Red Hat, Inc.
This file is part of Cygwin.
This software is a copyrighted work licensed under the terms of the
Cygwin license. Please consult the fil
http://www.codebf.com/read/124347/6053108
-
A=[-0.2,0.5,0,0,0;0,-0.5,1.6,0,0;0,0,-14.3,85.8,0;
0,0,0,-33.3,100;0,0,0,0,-10];
B=[0; 0; 0; 0; 30]; Q=diag([10,20,6,2,5]); R=1;
C=[1,0,0,0,0]; D=0; [K,P]=lqr(A,B,Q,R); eig(A-B*K)
[K2,P2]=lq
http://www.codebf.com/read/480430/6664178
-
A =[
0 1 1 0 1 0 1 0 1
0 0 0 0 1 1 1 1 1
1 1 1 1 1 0 1 0 0
1 1 0 0 1 1 0 0 1
1 0 0 1 1 1 0 0 0
1 1 1 0 0 1 0 1 0
0 1 0 0 0 1 1 1 1
0 1 0 0 1 1 1 1 1
0 1 0 0 0 1 1 1 1
1 0 1 1
http://www.codebf.com/read/473057/6854440
-
A = [1, 3, 5, 7; 2, 4, 6, 8]; [L, A1, M] = svd(A)
L*A1*M'
norm(A-ans)
http://www.codebf.com/read/466623/7029835
-
A* 算法求解最短路径2008年07月17日 星期四 下午 03:26这个问题太老土了，但是绝对经典，我现在就在研究启发式搜索算法，用A*算法来做这个题目比较好了，给你一个很详细的介绍吧！
下面的是以前数据结构与算法的版主starfish提供的，你好好看看吧。不错的
A* 算法求解最短路径
------------------------------------- ...
http://www.codebf.com/read/411330/7083314
-
>> a.b = struct('z', {});
a.b
http://www.codebf.com/read/462042/7211847
-
/* A program to test
*/
int x[10];
int minloc(int a[],int low,int high)
{
int i;int x;
int k;
k=low;
x=a[low];
i=low+1;
while(i
http://www.codebf.com/read/457248/7330359
-
/*
* @(#)A.java 1.0 03/10/14
*
* You can modify the template of this file in the
* directory ..\JCreator\Templates\Template_1\Project_Name.java
*
* You can also create your own project tem
http://www.codebf.com/read/452756/7433340
-
A=[-0.2,0.5,0,0,0;0,-0.5,1.6,0,0;0,0,-14.3,85.8,0;
0,0,0,-33.3,100;0,0,0,0,-10];
B=[0; 0; 0; 0; 30]; Q=diag([10,20,6,2,5]); R=1;
C=[1,0,0,0,0]; D=0; [K,P]=lqr(A,B,Q,R); eig(A-B*K)
[K2,P2]=lq
http://www.codebf.com/read/297402/8024952
-
// A.cpp : Defines the class behaviors for the application.
//
#include "stdafx.h"
#include "A.h"
#include "ADlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FI
http://www.codebf.com/read/194935/8184157
