- MatrixAndQuaternionsFaq . . . . 11 matches
to defining 3D algorithms, it is possible to predict and plan the
(D,E,F). A the algorithm
Altogether, this algorithm will use the following amounts of processing
Thus, the final algorithm is as follows:
Using the optimised algorithm, only 12 multiplications, 6 subtractions
So, it is obvious that by using the optimised algorithm, a performance
occasionally become rather loopy. This is normal, as the algorithm
the following algorithm:
Given the rotation axis and angle, the following algorithm may be
using the following algorithm:
Using a 4x4 matrix library, the algorithm is as follows:
- 알고리즘5주참고자료 . . . . 6 matches
[http://en.wikipedia.org/wiki/Randomized_algorithm Randomized algorithm]
[http://en.wikipedia.org/wiki/Las_Vegas_algorithm Las Vegas algorithm]
[http://en.wikipedia.org/wiki/Monte_Carlo_algorithm Monte Carlo algorithm]
- MoreEffectiveC++/Miscellany . . . . 5 matches
STL은 많은 조직-거의 모든 C++라이브러리-에 영향을 미치는 것 같다. 그래서 그것의 일반적인 개념과 친해지는 것은 매우 중요하다. 그들은 이해하기는 어렵지 않다. STL은 세가지의 기본적인 개념에 기반하고 있다.: container, iterator, algorithm. Container는 객체의 모음(collection)이다. Iterator는 STL 컨테이너에서 당신이 built-in 형의 인자들을 포인터로 조정하는 것처럼 객체를 가리킨다. Algorithm은 STL container와 iterator를 사용해서 그들의 일을 돕는데 사용하는 함수이다.
STL, 그것의 중심(core)는 매우 간단하다. 그것은 단지, 대표 세트(set of convention)를(일반화 시켰다는 의미) 덧붙인 클래스와 함수 템플릿의 모음이다. STL collection 클래스는 클래스로 정의되어진 형의 iterator 객체 begin과 end 같은 함수를 제공한다. STL algorithm 함수는 STL collection상의 iterator 객체를 이동시킨다. STL iterator는 포인터와 같이 동작한다. 그것은 정말로 모든 것이 포인터 같다. 큰 상속 관계도 없고 가상 함수도 없고 그러한 것들이 없다. 단지 몇개의 클래스와 함수 템플릿과 이들을 위한 작성된 모든 것이다.
또 다른 면을 말한다.: STL은 확장성이 있다. 당신은 당신의 collection, algorithms, iterator를 STL에 추가할수 있다. 당신이 STL 협의를 따르는 이상 표준 STL collection은 아마도 당신의 algorithm과 당신의 collection은 STL의 algorithms과 함깨 동작할 것이다. 물론 당신의 템플릿은 표준 C++ 라이브러리의 한부분이 아니다. 그렇지만 그들은 같은 원리로 만들어 질것이고, 재사용 될것이다.
- ACM_ICPC/2013년스터디 . . . . 4 matches
* Maximum Sum - kadane's algorithm
* proof - [http://prezi.com/fsaynn-iexse/kadanes-algorithm/]
* Tarjan's strongly connected components algorithm - [http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm 링크]
* Sliding Window Minimum Algorithm - http://people.cs.uct.ac.za/~ksmith/articles/sliding_window_minimum.html
- BabyStepsSafely . . . . 4 matches
This article outlines the refactoring of an algorithm that generate the prime numbers up to a user specified maximum. This algorithm is called the Sieve of Eratosthenes. This article demonstrates that the granularity of the changes made to the source code are very small and rely completely on the ability to recompile and test the code after every change no matter how small. The step where the code is tested insures that each step is done safely. It is important to note that the execution of tests do not actually guarantee that the code is correct. The execution of the tests just guarantees that it isn't any worse that it used to db, prior to the change. This is good enough for the purposes of refactoring since we are tring to not damage anything thay may have worked before Therefore for each change in the code we will be recompilling the code and running the tests.
The algorithm is quite simple. Given an array of integers starting at 2.Cross out all multiples of 2. Find the next uncrossed integer, and cross out all of its multiples. Repeat until you have passed the square root of the maximum value. This algorithm is implemented in the method generatePrimes() in Listing1. "Class GeneratePrimes,".
- AcceleratedC++/Chapter13 . . . . 3 matches
return min(Core::grade(), thesis); // min()은 <algorithm>에 정의된 함수이다.
#include <algorithm>
#include <algorithm>
- AcceleratedC++/Chapter6 . . . . 3 matches
= Chapter 6 Using Library Algorithms =
* 음. 또 새로운 것이 보이지 않는가? copy는 generic algorithm의 예이고, back_inserter는 반복자 어댑터의 예이다. 이게 무엇인지는 차근차근 살펴보도록 하자.
* Generic algorithm이라는 컨테이너의 부분이 아닌 알고리즘이다. 파라메터로 반복자를 받는다. 비슷하지 않은가? .이 없다 뿐이지 그냥 쓰자.
#include <algorithm>
== 6.4 Algorithms, containers, and iterators ==
- EffectiveSTL/ProgrammingWithSTL . . . . 3 matches
= Item43. Prefer algorithm calls to hand-written loops. =
= Item44. Prefer member functions to algorithms with the same names. =
= Item46. Consider function objects instead of functions as algorithm parameters. =
- MedusaCppStudy/석우 . . . . 3 matches
#include <algorithm>
#include <algorithm>
#include <algorithm>
- 2002년도ACM문제샘플풀이/문제D . . . . 2 matches
#include <algorithm>
#include <algorithm>
- 2002년도ACM문제샘플풀이/문제E . . . . 2 matches
#include <algorithm>
#include <algorithm>
- AcceleratedC++/Chapter14 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- AcceleratedC++/Chapter3 . . . . 2 matches
* 중간값을 찾기 위해 먼저 해야할 작업 sort : algorithm 헤더에 정의되어 있다.
#include <algorithm>
- AcceleratedC++/Chapter8 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- CPPStudy_2005_1/STL성적처리_1_class . . . . 2 matches
#include <algorithm>
#include <algorithm>
- CollaborativeFiltering . . . . 2 matches
=== Algorithms ===
* Mean-square difference algorithm
* Overview on various CF algorithms (recommended) http://www.research.microsoft.com/users/breese/cfalgs.html
- Gof/Strategy . . . . 2 matches
텍스트 스트림을 줄 단위로 나누는 많은 알고리즘들이 있다. (이하 linebreaking algorithm). 해당 알고리즘들이 그것을 필요로 하는 클래스에 긴밀하게 연결되어있는 것은 여러가지 이유 면에서 바람직하지 못하다.
* ET++, InterViews - line breaking algorithms as we've described.
* RApp (system for integrated circult layout) - Router Algorithms.
- Gof/Visitor . . . . 2 matches
- implements each operation declared by Visitor. Each operation implements a fragment of the algorithm defined for the corresponding class of object in the structure. ConcreteVisitor provides the context for the algorithm and stores its local state. This state often accumulates result during the traversal of the structure.
- IsBiggerSmarter?/문보창 . . . . 2 matches
단순히 Greedy 알고리즘으로 접근. 실패. Dynamic Programming 이 필요함을 테스트 케이스로써 확인했다. Dynamic Programming 을 실제로 해본 경험이 없기 때문에 감이 잡히지 않았다. Introduction To Algorithm에서 Dynamic Programing 부분을 읽어 공부한 후 문제분석을 다시 시도했다. 이 문제를 쉽게 풀기 위해 Weight를 정렬한 배열과 IQ를 정렬한 배열을 하나의 문자열로 보았다. 그렇다면 문제에서 원하는 "가장 긴 시퀀스" 는 Longest Common Subsequence가 되고, LCS는 Dynamic Algorithm으로 쉽게 풀리는 문제중 하나였다. 무게가 같거나, IQ가 같을수도 있기 때문에 LCS에서 오류가 나는 것을 피하기 위해 소트함수를 처리해 주는 과정에서 약간의 어려움을 겪었다.
==== ver1 (Greedy Algorithm) ====
#include <algorithm>
==== ver2. Dynamic Algorithm ====
#include <algorithm>
- MedusaCppStudy/세람 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- MedusaCppStudy/신애 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- OperatingSystemClass/Exam2002_2 . . . . 2 matches
How many page faults would occur for the following replacement algorithm, assuming one, three, five, seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each.
Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requrests, for each of the following disk scheduling algorithms?
- STL . . . . 2 matches
C++ 의 [GenericProgramming] 기법인 Template 을 이용, container (["DataStructure"] class. 다른 언어에서의 Collection class 들에 해당) 와 [Algorithm|algorithm] 에 대해 구축해놓은 라이브러리.
==== algorithm ====
- TheGrandDinner/김상섭 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- TheGrandDinner/하기웅 . . . . 2 matches
- algorithm 라이브러리 너무 좋음..ㅋㅋㅋ
#include <algorithm>
- wiz네처음화면 . . . . 2 matches
* http://www.joinc.co.kr/modules/moniwiki/wiki.php/article/STL_algorithm#AEN54 STL algorithm
- 강성현 . . . . 2 matches
* [algorithmStudy/2013] [algorithmStudy/2014] (2013.11 - 2014)
- 권영기 . . . . 2 matches
* [algorithmStudy/2013]
* [algorithmStudy/2014]
* [AlgorithmStudy/2015]
- 문자반대출력/문보창 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- 알고리즘8주숙제 . . . . 2 matches
Consider the problem of scheduling n jobs on one machine. Describe an algorithm to find a schedule such that its average completion time is minimum. Prove the correctness of your algorithm.
|| [Leonardong] || 2h || [http://wiki.zeropage.org/trac/leonardong/browser/AlgorithmTrainning/OptimalBST.py] ||
- 조영준 . . . . 2 matches
* Algorithm problem solving
* [AlgorithmStudy/2016]
* [AlgorithmStudy/2015]
* [algorithmStudy/2014]
* [algorithmStudy/2013]
- 2002년도ACM문제샘플풀이/문제A . . . . 1 match
// sort 함수는 #include <algorithm> 한다음
- 2002년도ACM문제샘플풀이/문제B . . . . 1 match
#include <algorithm>
- 3학년강의교재/2002 . . . . 1 match
|| 알고리즘 || (원)foundations of algorithms || Neapolitan/Naimpour || Jones and Bartlett ||
- AcceleratedC++ . . . . 1 match
|| ["AcceleratedC++/Chapter6"] || Using library algorithms || 3주차 ||
- AcceleratedC++/Chapter11 . . . . 1 match
#include <algorithm>
- AcceleratedC++/Chapter4 . . . . 1 match
#include <algorithm>
- AcceleratedC++/Chapter7 . . . . 1 match
#include <algorithm>
- AcceleratedC++/Chapter9 . . . . 1 match
#include <algorithm>
- AproximateBinaryTree/김상섭 . . . . 1 match
#include <algorithm>
- Boost/SmartPointer . . . . 1 match
#include <algorithm>
- BoostLibrary/SmartPointer . . . . 1 match
#include <algorithm>
- Bridge/권영기 . . . . 1 match
#include<algorithm>
- BusSimulation/영창 . . . . 1 match
구현특이사항 : vector, map, algorithm 등 stl 클래스 사용
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 1 match
#include <algorithm>
- CPPStudy_2005_1/STL성적처리_1 . . . . 1 match
#include <algorithm>
- CPPStudy_2005_1/STL성적처리_2 . . . . 1 match
#include <algorithm>
- CPPStudy_2005_1/STL성적처리_3 . . . . 1 match
#include <algorithm> //sort
- CPPStudy_2005_1/STL성적처리_3_class . . . . 1 match
#include <algorithm> //sort
- CPPStudy_2005_1/STL성적처리_4 . . . . 1 match
#include <algorithm>
- CPPStudy_2005_1/질문 . . . . 1 match
#include <algorithm>
- ClassifyByAnagram/상규 . . . . 1 match
#include <algorithm>
- CodeRace/20060105/도현승한 . . . . 1 match
#include <algorithm>
- CodeRace/20060105/아영보창 . . . . 1 match
#include <algorithm>
- CppStudy_2002_2/STL과제/성적처리 . . . . 1 match
#include <algorithm>
- DPSCChapter2 . . . . 1 match
3. Provider/Plan Match. An automated process attempts to mach the plan (the contract unser which the claim is being paid) and the health care provider (e.g., the doctor) identified on the claim with the providers with which the overall claim processing organization has a contract. If there is no exact match, the program identifies the most likely matches based on soundex technology (an algorithm for finding similar-sounding words). The system displays prospective matches to knowledge workers in order of the likeinhood of the match, who then identify the correct provider.
- DataStructure . . . . 1 match
* 파스칼을 만들고 튜링상을 받은 Niklaus Wirth 교수는 ''Algorithms+Data Structures=Programs''라는 제목의 책을 1976년에 출간했다.
* OOP시대에는 위의 개념이 살짝 바뀌었더군여. Algorithms+Data Structure=Object, Object+Object+....+Object=Programs 이런식으로..
* [http://www.inf.fh-flensburg.de/lang/algorithmen/sortieren/ 소팅잘나온사이트]
see also HowToStudyDataStructureAndAlgorithms
- DoItAgainToLearn . . . . 1 match
In my own experience of designing difficult algorithms, I find a certain technique most helpfult in expanding my own capabilities. After solving a challenging problem, I solve it again from scratch, retracing only the ''insight'' of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that ''would'' have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value. ...... The rules of Fortran can be learned within a few hours; the associated paradigms take much longer, both to learn and to unlearn. --Robert W. Floyd
- EightQueenProblem/강인수 . . . . 1 match
#include <algorithm>
- FindShortestPath . . . . 1 match
이거 dijkstra's shortest path algorithm 아닌가요? - 임인택
- JollyJumpers/Celfin . . . . 1 match
#include <algorithm>
- LinuxSystemClass/Exam_2004_1 . . . . 1 match
Linux 에서의 Memory 관리시 binary buddy algorithm 을 이용한다. 어떻게 동작하는지 쓰시오.
- LongestNap/문보창 . . . . 1 match
#include <algorithm>
- Map/곽세환 . . . . 1 match
#include <algorithm>
- Map연습문제/곽세환 . . . . 1 match
#include <algorithm>
- Map연습문제/임민수 . . . . 1 match
#include <algorithm>
- MedusaCppStudy/재동 . . . . 1 match
#include <algorithm>
- Monocycle/조현태 . . . . 1 match
#include <algorithm>
- NumericalExpressionOnComputer . . . . 1 match
the art of computer programming, vol2 : seminumerical algorithms
- OperatingSystemClass/Exam2002_1 . . . . 1 match
9. 동적으로 우선순위가 변화되는 preemptive priorty-scheduling algorithm 을 생각해 보자. 큰 값을 가진 우선순위 번호가 더 높은 우선순위를 가진다고 가정하자. 만약 프로세스가 초기값으로 우선순위값 0를 갖고, CPU를 기다릴 때(ready 상태)에는 우선순위 값 a를 갖고, running 상태에는 우선순위값 b 를 갖는다면,[[BR]]
- Pairsumonious_Numbers/권영기 . . . . 1 match
#include<algorithm>
- PokerHands/Celfin . . . . 1 match
#include <algorithm>
- ResponsibilityDrivenDesign . . . . 1 match
* object 에 대해서 기존의 'data + algorithms' 식 사고로부터 'roles + responsibilities' 로의 사고의 전환.
- Robbery/조현태 . . . . 1 match
#include <algorithm>
- SOLDIERS/송지원 . . . . 1 match
#include <algorithm>
- SOLDIERS/정진경 . . . . 1 match
#include <algorithm>
- STL/search . . . . 1 match
#include <algorithm> // search 알고리즘 쓰기 위한것
- STL/sort . . . . 1 match
#include <algorithm> // sort 알고리즘 쓰기 위한것
- Shoemaker's_Problem/곽병학 . . . . 1 match
#include<algorithm>
- Shoemaker's_Problem/김태진 . . . . 1 match
#include <algorithm>
- Star/조현태 . . . . 1 match
#include <algorithm>
- TAOCP/BasicConcepts . . . . 1 match
= 1.1 Algorithms =
== 알고리즘 E(유클리드의 알고리즘(Euclid's algorithm)) ==
=== Algorithm A ===
=== Another Approach(Algorithm B) ===
=== Algorithm I ===
- TheGrandDinner/조현태 . . . . 1 match
#include <algorithm>
- UML/CaseTool . . . . 1 match
Reverse engineering encloses the problematic, that diagram data is normally not contained with the program source, such that the UML tool, at least in the initial step, has to create some ''random layout'' of the graphical symbols of the UML notation or use some automatic ''layout algorithm'' to place the symbols in a way that the user can understand the diagram. For example, the symbols should be placed at such locations on the drawing pane that they don't overlap. Usually, the user of such a functionality of an UML tool has to manually edit those automatically generated diagrams to attain some meaningfulness. It also often doesn't make sense to draw diagrams of the whole program source, as that represents just too much detail to be of interest at the level of the UML diagrams. There are also language features of some [[programming language]]s, like ''class-'' or ''function templates'' of the programming language [[C plus plus|C++]], which are notoriously hard to convert automatically to UML diagrams in their full complexity.
- User Stories . . . . 1 match
Another difference between stories and a requirements document is a focus on user needs. You should try to avoid details of specific technology, data base layout, and algorithms. You should try to keep stories focused on user needs and benefits as opposed to specifying GUI layouts.
- VendingMachine/세연/1002 . . . . 1 match
#include <algorithm>
- VitosFamily/Celfin . . . . 1 match
#include <algorithm>
- VonNeumannAirport/1002 . . . . 1 match
#include <algorithm>
- WeightsAndMeasures/김상섭 . . . . 1 match
#include <algorithm>
- WeightsAndMeasures/문보창 . . . . 1 match
#include <algorithm>
- Yggdrasil/가속된씨플플/4장 . . . . 1 match
* max()라는 함수가 의심스럽다. 분명 msdn에도 algorithm헤더에 있다고 했는데 컴파일하면 자꾸 정의되지 않은 이름이라 에러를 뱉어낸다. 이 함수의 정체는?
- [Lovely]boy^_^/Diary/2-2-15 . . . . 1 match
* A algorithm course ended. This course does not teaches me many things.
- [Lovely]boy^_^/USACO/MixingMilk . . . . 1 match
#include <algorithm>
- [Lovely]boy^_^/[Lovely]boy^_^/USACO/Barn . . . . 1 match
#include <algorithm>
- callusedHand . . . . 1 match
["callusedHand/projects/algorithms"]
- crossedladder/곽병학 . . . . 1 match
#include <algorithm>
- koi_aio/권영기 . . . . 1 match
#include<algorithm>
- koi_cha/곽병학 . . . . 1 match
#include <algorithm>
- sort/권영기 . . . . 1 match
#include<algorithm>
- subsequence/권영기 . . . . 1 match
#include<algorithm>
- usa_selfish/권영기 . . . . 1 match
#include<algorithm>
- usa_selfish/김태진 . . . . 1 match
#include <algorithm>
- 경시대회준비반 . . . . 1 match
[http://www.algorithmist.com/] ACM 문제가 어느 알고리즘 파트인지 알 수 있다. 그외 도전할만한 많은 문제들이 있다.
- 고슴도치의 사진 마을 . . . . 1 match
|| [http://165.194.17.5/wiki/index.php?url=zeropage&no=3818&title=알고리즘&login=processing&id=celfin&redirect=yes algorithms] ||
- 고슴도치의 사진 마을처음화면 . . . . 1 match
|| [http://165.194.17.5/wiki/index.php?url=zeropage&no=3818&title=알고리즘&login=processing&id=celfin&redirect=yes algorithms] ||
- 벡터/곽세환,조재화 . . . . 1 match
#include <algorithm>
- 벡터/권정욱 . . . . 1 match
#include <algorithm>
- 벡터/김수진 . . . . 1 match
#include<algorithm>
- 벡터/김태훈 . . . . 1 match
#include <algorithm>
- 벡터/김홍선,노수민 . . . . 1 match
#include <algorithm>
- 벡터/박능규 . . . . 1 match
#include <algorithm>
- 벡터/유주영 . . . . 1 match
#include <algorithm>
- 벡터/임민수 . . . . 1 match
#include <algorithm>
- 벡터/임영동 . . . . 1 match
#include<algorithm>
- 벡터/조동영 . . . . 1 match
#include <algorithm>
- 벡터/황재선 . . . . 1 match
#include <algorithm>
- 사랑방 . . . . 1 match
purely functional language - Haskell 로 구현한 quick sort algorithm..
- 새싹교실/2012/주먹밥 . . . . 1 match
#include<algorithm.h>
- 서지혜 . . . . 1 match
* [algorithmStudy/2013]
- 알고리즘3주숙제 . . . . 1 match
Note: The algorithm below works for any number base, e.g. binary, decimal, hexadecimal, etc. We use decimal simply for convenience.
- 알고리즘8주숙제/문보창 . . . . 1 match
#include <algorithm>
- 정모/2012.11.5 . . . . 1 match
* [김태진]학우의 ACM_ICPC with algorithms
Found 122 matching pages out of 7548 total pages (5000 pages are searched)
You can also click here to search title.
