代码搜索：satisfied
找到约 108 项符合「satisfied」的源代码
代码结果 108
www.eeworm.com/read/429797/8788482
m get_p_q.m
function [Fsn, p, q, errors]=get_p_q(Fs, Fsd, tol)
% % get_p_q: Calculate p and q with p
www.eeworm.com/read/421666/10712922
mod sat.mod
/* SAT, Satisfiability Problem */
/* Written in GNU MathProg by Andrew Makhorin */
param m, integer, > 0;
/* number of clauses */
param n, integer, > 0;
/* number of variables *
www.eeworm.com/read/238482/13883593
c verify.c
/*
Copyright 2004 Demian Battaglia, Alfredo Braunstein, Michal Kolar,
Michele Leone, Marc Mezard, Martin Weigt and Riccardo Zecchina
This file is part of SPY (Survey Propagation with fini
www.eeworm.com/read/132748/5909765
h coda_opstats.h
/*
* Operation statistics for Coda.
* Copyright (C) 1997 Carnegie Mellon University
*
* Carnegie Mellon University encourages users of this software
* to contribute improvements to the Coda pro
www.eeworm.com/read/125688/6022878
h coda_opstats.h
/*
* Operation statistics for Coda.
* Copyright (C) 1997 Carnegie Mellon University
*
* Carnegie Mellon University encourages users of this software
* to contribute improvements to the Coda pro
www.eeworm.com/read/102395/6233308
txt swap2.txt
The last condition that must be satisfied by another exchange is:
c) the pivot element is at its final position in the array.
www.eeworm.com/read/196983/8037894
c root.c
/*****************************************************************************
* *
* -------------------------------- root
www.eeworm.com/read/103142/6221365
h cevent.h
//---------------------------------------------------------------------------
#ifndef _CEVENT_H_
#define _CEVENT_H_
//---------------------------------------------------------------------------
#i
www.eeworm.com/read/484548/6579617
m serimcrop.m
function [crop,rect] = serimcrop(series);
% Crops a region of an image series, and outputs a smaller 3D matrix
% While loop ensures user is satisfied with choice
% If prime is 1, function will no
www.eeworm.com/read/151063/12237403
out net20.out
conf. satisfied, # of batches = 3
Group Source Node CR CL Ave L CM Min D Max D Jitter Ave D Conf D Conf L