代码搜索:heuristics

找到约 65 项符合「heuristics」的源代码

代码结果 65
www.eeworm.com/read/131315/5946378

heuristics

This file contains a description of GNU's heuristics. Copyright (C) 1986, 1987 Free Software Foundation, Inc. This file is part of CHESS. CHESS is distributed in the hope that it will be useful,
www.eeworm.com/read/418634/2087123

dat heuristics.dat

re\sf\si\snance ra\st\ses ap\sp\sroved [lL]ow-[rR]ate\sAdvisors\sInc l\se\snders cred\si\st [pP][^a-zA-Z0-9]*[iI1|l!][^a-zA-Z0-9]*[!iI1|lL][^a-zA-Z0-9]*[!iI1|lL][^a-zA-Z0-9]*[sS] [vV][^a-zA-Z0-
www.eeworm.com/read/207991/5000405

h opt_heuristics.h

#ifndef _OPT_HEURISTICS_ #define _OPT_HEURISTICS_ #include "mal.h" #include "mal_function.h" #include "mal_scenario.h" #include "mal_builder.h" #include "opt_prelude.h" #include "mal_interpreter.h"
www.eeworm.com/read/207991/5000457

c opt_heuristics.c

#line 71 "/export/scratch0/monet/monet.GNU.64.64.d.14791/MonetDB5/src/optimizer/opt_heuristics.mx" #include "mal_config.h" #include "opt_heuristics.h" int SPcombi000(MalBlkPtr mb, int pc1, int pc2) {
www.eeworm.com/read/207991/5000462

mx opt_heuristics.mx

@' The contents of this file are subject to the MonetDB Public License @' Version 1.1 (the "License"); you may not use this file except in @' compliance with the License. You may obtain a copy of the
www.eeworm.com/read/486389/6540875

doc knightst.doc

******************** Knight's Tour Problem ******************** Knight's Tour is one of the int
www.eeworm.com/read/149108/12403458

doc nouveau document microsoft word.doc

Complete methods: The complete methods requiring much calculations, for these first heuristic, we represented the chess-board by a matrix where one represents by 2
www.eeworm.com/read/221024/14772946

html http:^^www.cs.washington.edu^education^courses^473^assignment6.html

Date: Mon, 02 Dec 1996 15:59:40 GMT Server: NCSA/1.4.2 Content-type: text/html CSE 473 Assignment 6 CSE 473 Assignment 6 Due Monday, May 13 in clas
www.eeworm.com/read/184175/9118889

m minasym.m

% % function [util,f,w,R] = minasym(C,D,R,pmax,rP,a,b,s,loss,htype,tip) % % given coordinate matrix C, trafix matrix D, Pmax, fading coefficient a