代码搜索:Implementations

找到约 4,027 项符合「Implementations」的源代码

代码结果 4,027
www.eeworm.com/read/402283/11539720

m testvander.m

% testvander.m % script file to test vandermonde implementations x=(1:20)'; % column vector for input data m=20; % highest power to compute sf={'vander1','vander2','vander3','van
www.eeworm.com/read/402283/11539727

m testrepeat.m

% testrepeat % script file to test repeat implementations xdata=rand(1,200); % data to test ndata=repmat([3 8 2 1 0 6 9 5 7 4],1,200/10); % counts N=1:200; x=xdata; % refresh
www.eeworm.com/read/402283/11539778

m testrepeati.m

% testrepeati % script file to test repeat implementations N=100; xdata=rand(1,N); % data to test ndata=repmat(randperm(20),1,N/20); % counts x=xdata; % refresh data n=ndata;
www.eeworm.com/read/256561/11987409

readme

ksp is a implementations of finding the k shortest paths algorithm. It is also a C/C++ library including some classical graph relative algrithm implementations. More information about ksp as well
www.eeworm.com/read/221024/14773927

html http:^^www.cs.cornell.edu^info^courses^spring-96^cs516^homework_3^homework_3.html

MIME-Version: 1.0 Server: CERN/3.0 Date: Monday, 16-Dec-96 23:50:14 GMT Content-Type: text/html Content-Length: 958 Last-Modified: Tuesday, 27-Feb-96 18:49:03 GMT
www.eeworm.com/read/211148/15186116

readme

ksp is a implementations of finding the k shortest paths algorithm. It is also a C/C++ library including some classical graph relative algrithm implementations. More information about ksp as well
www.eeworm.com/read/171479/5395270

groovy unicodeescapes1.groovy

package gls.ch03.s03 /** * GLS 3.3: * Implementations first recognize Unicode escapes in their input, translating * the ASCII characters backslash and 'u' followed by four hexadecimal digits * to
www.eeworm.com/read/169697/5412799

c nfslock.c

/* -*- Mode: C; c-basic-offset:4 ; -*- */ /* * (C) 2004 by Argonne National Laboratory. * See COPYRIGHT in top-level directory. */ #include #include #include #
www.eeworm.com/read/168845/5434198

rst algorithms.rst

The MPL provides a broad range of fundamental algorithms aimed to satisfy the majority of sequential compile-time data processing needs. The algorithms include compile-time counterparts of many
www.eeworm.com/read/165261/5484032

java batchpreparedstatementsetter.java

/* * Copyright 2002-2004 the original author or authors. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License.