代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/214167/15112313
cpp prg15_6.cpp
// File: prg15_6.cpp
// the program solves the 8-Queens problem. it prompts the user for
// the starting row for the queen in column 0 and calls the recursive
// backtracking function queens() to d
www.eeworm.com/read/212602/15152274
m fm_opfm.m
function fm_opfm
%FM_OPFMR solves the OPF-based electricity market problem by means of
% an Interior Point Method with a Merhotra Predictor-Corrector
% or Newton direction technique.
www.eeworm.com/read/212602/15152326
m fm_set.m
function fm_set(varargin)
% FM_SET define general settings and operations for
% the main window and other utilities
%
%FM_SET(COMMAND)
% COMMAND = 'lf' solves power flow
% COMMAND =
www.eeworm.com/read/208659/15239428
m tdofss_modal_xfer_modes.m
% tdofss_modal_xfer_modes.m state-space modal form transfer function
% analysis of tdof model, proportional damping, modal contribution
% plotting.
% Solves for and plots frequency responses for
www.eeworm.com/read/208576/15243612
cpp gradebook.cpp
// Fig. 4.13: GradeBook.cpp
// Member-function definitions for class GradeBook that solves the
// class average program with sentinel-controlled repetition.
#include
using std::cout;
www.eeworm.com/read/13911/287368
txt svm.txt
function [iter, optCond, time, w, gamma] = lsvm(A,D,nu,tol,maxIter,alpha, ...
perturb,normalize);
% LSVM Langrangian Support Vector Machine algorithm
% LSVM solves a support vector machine proble
www.eeworm.com/read/457459/1597191
java solvers.java
package org.sunflow.math;
public final class Solvers {
/**
* Solves the equation ax^2+bx+c=0. Solutions are returned in a sorted array
* if they exist.
*
* @param a co
www.eeworm.com/read/216450/4895589
c test13b.c
/*
* Test name: test13b.c
*
* Objective: The purpose of this tests is to show how pselect()
* solves the situation shown in test13a.c
*
* Description: The program waits for SIGHUP or input in t
www.eeworm.com/read/285908/4044189
m pfminbnd.m
function [X,FVAL,EXITFLAG,OUTPUT] = pfminbnd(FUN,initialX,LB,UB,options)
%PFMINBND Finds minimum of a function with bound constraints.
% PFMINBND solves problems of the form:
% min F(X) s
www.eeworm.com/read/285908/4044196
m pfminlcon.m
function [X,FVAL,EXITFLAG,OUTPUT] = pfminlcon(FUN,initialX,Aineq,Bineq,Aeq,Beq,LB,UB,options)
%PFMINLCON Finds a linearly constrained minimum of a function.
% PFMINLCON solves problems of the form