- 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
- 2002년도ACM문제샘플풀이/문제E . . . . 2 matches
#include <algorithm>
#include <algorithm>
- 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>
- STL . . . . 2 matches
C++ 의 [GenericProgramming] 기법인 Template 을 이용, container (["DataStructure"] class. 다른 언어에서의 Collection class 들에 해당) 와 [Algorithm|algorithm] 에 대해 구축해놓은 라이브러리.
==== 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]
* [AlgorithmStudy/2015]
- 문자반대출력/문보창 . . . . 2 matches
#include <algorithm>
#include <algorithm>
- AcceleratedC++/Chapter9 . . . . 1 match
#include <algorithm>
- BoostLibrary/SmartPointer . . . . 1 match
#include <algorithm>
- BusSimulation/영창 . . . . 1 match
구현특이사항 : vector, map, algorithm 등 stl 클래스 사용
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 1 match
#include <algorithm>
- CPPStudy_2005_1/STL성적처리_2 . . . . 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.
- EightQueenProblem/강인수 . . . . 1 match
#include <algorithm>
- Map/곽세환 . . . . 1 match
#include <algorithm>
- Robbery/조현태 . . . . 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 ===
- 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>
- WeightsAndMeasures/김상섭 . . . . 1 match
#include <algorithm>
- WeightsAndMeasures/문보창 . . . . 1 match
#include <algorithm>
- Yggdrasil/가속된씨플플/4장 . . . . 1 match
* max()라는 함수가 의심스럽다. 분명 msdn에도 algorithm헤더에 있다고 했는데 컴파일하면 자꾸 정의되지 않은 이름이라 에러를 뱉어낸다. 이 함수의 정체는?
- callusedHand . . . . 1 match
["callusedHand/projects/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
purely functional language - Haskell 로 구현한 quick sort algorithm..
- 알고리즘3주숙제 . . . . 1 match
Note: The algorithm below works for any number base, e.g. binary, decimal, hexadecimal, etc. We use decimal simply for convenience.
Found 30 matching pages out of 7555 total pages (1170 pages are searched)
You can also click here to search title.
