Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Field
-
., difference-in-differences, instrumental variables, propensity-score methods) and selected machine-learning algorithms. Write reproducible code in Stata, R, SAS, or Python; summarize and interpret results
-
Programming II Desired Qualifications* Completion of CSC 375 Data Structures and CSC 379 Algorithm Analysis is preferred. Work Schedule Work on this project will take place during the Fall 2025 and Winter 2026
-
society. For over two decades, OII has led the field in exploring how innovations such as generative AI, machine learning, algorithmic platforms, and autonomous systems are transforming economies
-
purchasing, web time entry, mandatory SafeSport training, facility access controls, ID card presentations, brand alignment and respectful workplace related expectations Team scheduling, planning and
-
society. For over two decades, OII has led the field in exploring how innovations such as generative AI, machine learning, algorithmic platforms, and autonomous systems are transforming economies
-
vibrant department with active research clusters in algorithms, artificial intelligence, bioinformatics, computer networking, computer vision, graphics and Virtual Reality, high-performance computing, human
-
Interesting area of responsibility Collegial and friendly working atmosphere Flexible working schedule (e.g. possibility for home office, paid lunch break - depending on working hours) International training
-
or an equivalent qualification. We Offer Interesting area of responsibility Collegial and friendly working atmosphere Flexible working schedule (incl. paid lunch break - depending on working hours) International
-
of Engineering Position Headcount 1 Position Title Student Classroom Assistant - CPSC 350: Data Structures and Algorithms Academic Year Fall 2025 Term or Semester Fall Is this Role for an Undergrad or Grad Student
-
) Algorithm efficiency, asymptotic notation, solutions to recurrence relations. Greedy algorithms for graphs, scheduling problems, and greedy heuristic methods. Divide and conquer algorithms for sorting and