Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged find

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Janos Haits

Zendy | AI-Powered Research Library - 0 views

zendy.io

science library reference research searchengine info summary technology artificial intelligence search engine search metasearch tools engine internet Information Internet Information webs sites online

shared by Janos Haits on 20 Oct 24 - No Cached
  • Janos Haits on 20 Oct 24
     
    "Empowering knowledge with every search Explore open access and paywalled academic literature across all disciplines Trusted by over 675.3K readers Access over 40.7M research publications Download over 1.1M e-Books Find res"
Janos Haits

Tool Finder: Productivity Tools Reviews, Guides & News - 0 views

toolfinder.co

explorer place productivity workspace software tools tool service collaboration social online editor generator ai artificial intelligence directory TECHNOLOGY apps search

shared by Janos Haits on 09 Dec 24 - No Cached
  • Janos Haits on 09 Dec 24
     
    "Save hours finding the perfect productivity software with our 500+ in-depth reviews & ranked lists"
Janos Haits

Find the Best Ai Tools Directory | Feature AI Tools - 1 views

featureaitools.online

intelligence ai tools technology website artificial directory find Computer service

shared by Janos Haits on 02 Aug 24 - No Cached
  • Janos Haits on 02 Aug 24
     
    "Feature Ai Tools Top AI Tools Directory Discover all Top AI Tools for free in one website. With daily updates, stay up to date with new era of technology and unlock the potential of AI in your fingertips."
shalani mujer

Top-Notch Computer Tech Support Service - 1 views

I will always be thankful to ComputerTechSupportService because they always provide top caliber computer support service that you can never find anywhere. They have certified PC technicians wh...

computer support service

started by shalani mujer on 10 Nov 11 no follow-up yet
Abdelrahman Ogail

Common Mistakes in Online and Real-time Contests - 0 views

www.acm.org/...contests.html

shared by Abdelrahman Ogail on 09 Jun 09 - Cached
Islam TeCNo liked it
  • Dynamic programming problems are to be solved with tabular methods
    • Ahmed Mansour
      Ahmed Mansour on 09 Jun 09
       
      Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. ("Programming" in this context refers to a tabular method, not to writing computer code) y3ney 3bara 3n 2nene bn2sem el problem el kbirr le shwit probelsm so3'ira .. we ne solve el problems deh we ngma el yab2a dh 7l lel problem el kbira :D;d see introduction to algorithms book . chapter 15
  • breadth-first search
    • Ahmed Mansour
      Ahmed Mansour on 09 Jun 09
       
      In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. ya3ney be el 3arby keda lw ana 3ndy tree maslan we el tree dh bettkwen mn shwit levels 3ady gedan.. lama hagey 23mel search 3la node mo3ina fi el tree deh hamsk el tree mn el root bet3ha ely hwa level 0 we habda2 2mshy level by level y3ney hanzl 3la el level 1 we hakaz le 3'it mal2y el node bet3ty ,,,, see this ,, it's a tutorial show how BFS algorithm is work!! http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm
  • Memorize the value of pi You should always try to remember the value of pi as far as possible, 3.1415926535897932384626433832795, certainly the part in italics. The judges may not give the value in the question, and if you use values like 22/7 or 3.1416 or 3.142857, then it is very likely that some of the critical judge inputs will cause you to get the wrong answer. You can also get the value of pi as a compiler-defined constant or from the following code: Pi=2*acos(0)
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      hhhhhhhhhhh ...... awl mara a3rf el mawdo3 dah we awl mara a3raf en el Pi = 2*acos(0)
    • Abdelrahman Ogail
      Abdelrahman Ogail on 09 Jun 09
       
      Thanks Islam for the info, really useful
  • ...4 more annotations...
  • You cannot always check the equality of floating point numbers with the = = operator in C/C++. Logically their values may be same, but due to precision limit and rounding errors they may differ by some small amount and may be incorrectly deemed unequal by your program
  • #define swap(xxx, yyy) (xxx) ^= (yyy) ^= (xxx) ^= (yyy)
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      I remember someone told me that it's impossible to do swaping using macros :D ...but i think it's possible
  • But recursion should not be discounted completely, as some problems are very easy to solve recursively (DFS, backtracking)
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      Some problems are much easier when using recursion
  • Having a good understanding of probability is vital to being a good programmer
  • Ahmed Mansour on 09 Jun 09
     
    for bignner acmers hoping to be useful !
  • Ahmed Mansour on 09 Jun 09
     
    in this article the author discuss the common problems that faced teams in ACM contests .. and how to avoid it !
Abdelrahman Ogail

Hill climbing - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Hill_climbing

Algorithms Genetic-Algorithms

shared by Abdelrahman Ogail on 31 Jul 09 - Cached
  • In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is relatively simple to implement, making it a popular first choice. Although more advanced algorithms may give better results, in some situations hill climbing works just as well. Hill climbing can be used to solve problems that have many solutions, some of which are better than others. It starts with a random (potentially poor) solution, and iteratively makes small changes to the solution, each time improving it a little. When the algorithm cannot see any improvement anymore, it terminates. Ideally, at that point the current solution is close to optimal, but it is not guaranteed that hill climbing will ever come close to the optimal solution. For example, hill climbing can be applied to the traveling salesman problem. It is easy to find a solution that visits all the cities but will be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much better route is obtained. Hill climbing is used widely in artificial intelligence, for reaching a goal state from a starting node. Choice of next node and starting node can be varied to give a list of related algorithms.
Islam TeCNo

Uniform Resource Identifier - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/URI

shared by Islam TeCNo on 16 Jun 09 - Cached
  • In computing, a Uniform Resource Identifier (URI) consists of a string of characters used to identify or name a resource on the Internet. Such identification enables interaction with representations of the resource over a network (typically the World Wide Web) using specific protocols. Schemes specifying a specific syntax and associated protocols define each URI. Contents [hide]
    • Abdelrahman Ogail
      Abdelrahman Ogail on 16 Jun 09
       
      I've confused between URL & URI till reading this article !
    • Islam TeCNo
      Islam TeCNo on 17 Jun 09
       
      URL no3 men el URI :D ....ana faker eno kont shoft el 7eta deh fe ketab 3an el HTTP bas nesetha .......Zanks Zikas Again
  • A Uniform Resource Name (URN) functions like a person's name, while a Uniform Resource Locator (URL) resembles that person's street address. The URN defines an item's identity, while the URL provides a method for finding it. The ISBN system for uniquely identifying books provides a typical example of the use of typical URNs. ISBN 0486275574 (urn:isbn:0-486-27557-4) cites unambiguously a specific edition of Shakespeare's play Romeo and Juliet. In order to gain access to this object and read the book, one would need its location: a URL address. A typical URL for this book on a unix-like operating system might look like the file path file:///home/username/RomeoAndJuliet.pdf, identifying the electronic book saved in a local hard disk. So URNs and URLs have complementary purposes.
Abdelrahman Ogail

Genetic algorithm - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Genetic_algorithm

AI Machine-Learning

shared by Abdelrahman Ogail on 23 Jul 09 - Cached
  • A genetic algorithm (GA) is a search technique used in computing to find exact or approximate solutions to optimization and search problems. Genetic algorithms are categorized as global search heuristics. Genetic algorithms are a particular class of evolutionary algorithms (EA) that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover (also called recombination).
  • A typical genetic algorithm requires: a genetic representation of the solution domain, a fitness function to evaluate the solution domain.
  • Abdelrahman Ogail on 23 Jul 09
     
    GE are primary used in Learning in AI
Islam TeCNo

Design and Analysis of Computer Algorithms - 0 views

www.personal.kent.edu/...algorithm.html

shared by Islam TeCNo on 09 Jun 09 - Cached
Islam TeCNo liked it
  • Dijkstra's Algorithm
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      Algorithm for finding shortest path is graph
  • Huffman's Codes
    • Islam TeCNo
      Islam TeCNo on 09 Jun 09
       
      used in data compression
  • Ahmed Mansour on 09 Jun 09
     
    recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !
  • Ahmed Mansour on 09 Jun 09
     
    this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !
  • Islam TeCNo on 09 Jun 09
     
    Ohhhhhhh .....Gammmeeeeeeeeed gedan ya Mans ...thanks
Hassan Ibraheem

Making the most of your first job - Brief Article | Careers and Colleges | Find Article... - 0 views

findarticles.com/...ai_70739437

career

shared by Hassan Ibraheem on 25 Jun 09 - Cached
Ahmed One liked it
  • Hassan Ibraheem on 25 Jun 09
  • Ahmed One on 26 Jun 09
     
    Useful Article....Thanks
Ahmed Mansour

The F# Programming Language - 0 views

fslang.blogspot.com

shared by Ahmed Mansour on 16 Jun 09 - Cached
  • A Voyage to Functional Programming in F#
    • Islam TeCNo
      Islam TeCNo on 16 Jun 09
       
      el post fe nafs el saf7a deh ta7t :D ..mesh lazem 7ad yedos 3ala el link dah :D
    • Ahmed Mansour
      Ahmed Mansour on 16 Jun 09
       
      Nice Remark ya tecno :D
  • Finally I settled on F#. Both LISP and F# are belong to functional programming (FP) paradigm.Functional programming is a complete different paradigm from imperative (and OO) programming.I found it terse as well yet I can understand it (though some of the concepts are new to me).The advantage is it can use .NET Framework. Thus it gives me a break from OOP and yet taps the power from the familiar .NET Framework.Therefore I decided to dive into it to seem whether functional programming can deliver its claims in terms of productivity and expression power.I would like to share my findings in this blog to those interested in learning functional programming.
    • Ahmed One
      Ahmed One on 16 Jun 09
       
      This is the summary.
    • Islam TeCNo
      Islam TeCNo on 16 Jun 09
       
      Greeeaaaaat ......ana 2aret aktar men post ahoh 3ala el blog dah we isA a garb el F# Thanks Ya wa7ed :P
  • Ahmed One on 16 Jun 09
     
    Touch the function Programming in F#.
  • ...1 more comment...
  • Islam TeCNo on 16 Jun 09
     
    What is F# programming language?
  • Ahmed Mansour on 16 Jun 09
     
    thanks one :D ... great article
  • Ahmed Mansour on 16 Jun 09
     
    What is F# programming language?
shalani mujer

Computer Help Online - 1 views

Lately, my computer often experiences computer problem. I keep on calling our local technician to see whats wrong with my PC but sometimes I could not find him, if he is not away, he is not availab...

online computer help

started by shalani mujer on 12 Sep 11 no follow-up yet
seth kutcher

Computer Help Online - 1 views

Lately, my computer often experiences computer problem. I keep on calling our local technician to see whats wrong with my PC but sometimes I could not find him, if he is not away, he is not availab...

online computer help

started by seth kutcher on 12 Sep 11 no follow-up yet
Janos Haits

Find out where you are on the Cyberthreat map / Узнай, где сейчас кипит кибер... - 0 views

cybermap.kaspersky.com

research Science technology education anti-virus internet sec virus kaspersky online service tools tool attack map security attacks hacking network ddos computer web

shared by Janos Haits on 25 May 17 - Cached
  • Janos Haits on 25 May 17
     
    "CYBERTHREAT REAL-TIME MAP"
veera90

Global Life Sciences Solutions and Services Company | Life Sciences Industry Services a... - 0 views

www.acldigital.com/life-sciences

Lifesciences clinical medical pharma

shared by veera90 on 25 Nov 22 - No Cached
  • veera90 on 25 Nov 22
     
    ACL Digital Life Sciences has one of the largest pools of qualified resources in multiple functional areas who are adequately positioned to deliver comprehensive state-of-the art Services and Solutions across the entire Life Sciences domain.
‹ Previous 21 - 36 of 36
Showing 20▼ items per page