SaleForce developer in Viet Nam

$15-25 USD / hour

Zaprt

Objavljeno

pred več kot 3 leti

$15-25 USD / hour

Hi Guys, I'm looking for developer who has capability below: 1: Sales Force developer with minimum 3 years’ experience, must be able to work in HCMC or Da Nang office. 2: Sales Force Project Experience Required • Sales Force Enterprise CRM (Customer Relationship Manager). • Develop complex relational data within Sales Force Enterprise CRM framework • CRM Sales Reporting and Dashboards • Mobile Application Development using the Sales Force mobile SDK app development tools and solutions • Mobile Application Development of API interfacing of non-sales force mobile apps into the Sales Force Enterprise CRM. 3: Programming Languages • 3 years’ experience across multiple programming languages and frameworks

Salesforce.com

Salesforce App Development

CRM

Software Architecture

Local Job

Salesforce Marketing Cloud

ID projekta: 27501566

Več o projektu

2 ponudb

Aktivno pred 3 leti

Lokacija: Ho Chi Minh City, Vietnam

Želite zaslužiti?

E-naslov

Prednosti oddajanja ponudb na Freelancerju

Nastavite svoj proračun in časovni okvir

Prejmite plačilo za svoje delo

Povzetek predloga

Registracija in oddajanje ponudb sta brezplačna

2 freelancerjev je oddalo ponudbo s povprečno vrednostjo $21 USD/uro za to delo

@DavidThai

You can contact me directly via mobile: 0964 911 499 I am living in Vietnam, I am strong in C++, C#.NET 7.5.5 Path Planning Path planning can only be applied when a map of the environment is known. Only the robots that are capable of SLAM can therefore use optimum coverage path planning approaches [29, 31, 32] in order to achieve systematic covering of the entire free space. The complete coverage path problem differs from the problem of optimum path planning. If in optimum path planning the goal is to find the optimum path between the initial and goal point, the goal of complete coverage is to find the optimum path so the robot covers the entire space. If the space is divided into a grid of cells (cell size depends on the robot dimensions), the goal of optimum coverage is to visit every cell at least once, and in an optimal case only once. This problem is also known as the traveling salesman problem.

$20 USD v 20 dneh

0,0

(0 ocen)

0,0

@nguyenducthangdn

Hi, I'm living in both Da Nang and Ho Chi Minh, I did many project with many language before. Hope we can work together. Thanks and regards, Thang Nguyen Mobile +84 [!]

$22 USD v 40 dneh