仕事が見つかりません

申し訳ありませんが、お探しの仕事が見つかりませんでした。

最新の仕事をこちらで見つけてください:

Hi I am looking for an individual or a Team to make an app for me. details and the blueprint of the app will be shared upon discussion . thank you

$164 - $492
$164 - $492
0 入札

As a Senior React Developer you will be developing, maintaining, and growing our company’s web-based applications. We are looking for innovative problem solvers who can utilize their skills to have a big impact on our company by bringing our web-based applications to the next level. Core Responsibilities: * Designing, developing and supporting, a rewrite of our business applications in Reac...

$25 - $50 / hr
$25 - $50 / hr
0 入札

Looking for STATA Expert - should be available on immediate basis

$26 (Avg Bid)
$26 平均入札額
1 入札

Hi Experts, I am looking for a website expert who understands Adobe Cold Fusion and Javascript to fix a smart issue from my company website. Here is some background info. about the issue: - Envision by TechniCon is the catalog engine that is hosted on a Cold Fusion (CF) programming Javascript based website; - One of the catalog functions on the website is to take Autodesk files as inputs ...

$159 (Avg Bid)
$159 平均入札額
19 入札

I need help setting up a dockerfile.

$15 (Avg Bid)
$15 平均入札額
1 入札
C programming 6 日 left

Needed someone to do a C program for me [ログインしてURLを表示]

$7 - $21
$7 - $21
0 入札

HI, I'm looking for a developer to create a machine learning algorithm which will take in a job description and match it to a dataset of resumes. The algorithm must rank the resume dataset from a scale of 1 to 100 with 100 being the best match. This can't just be keyword matching - the algorithm must learn as more data is processed. Ideally, the programming language should be Pytho...

$1251 (Avg Bid)
$1251 平均入札額
17 入札

I need you to develop some software for me. I would like this software to be developed using PHP.

$10 - $16 / hr
$10 - $16 / hr
0 入札

We have n intervals [li,ri], We create a n vertex graph where each vertex represents an interval. There is an edge b/w u and v if and only if their corresponding intervals (call them interval u and v) intersect, I.e. Max(lv,lu) less than or equal to min(rv, ru), Now we have to count the no of dominating sets in the graph. Set S of vertices of graph G is a Dominating set if and only if each vertex...

$14 (Avg Bid)
$14 平均入札額
1 入札