My recent searches
Filter by:
    Job State
    24 jobs found, pricing in USD

    your task is to write Lisp functions to support hill-climbing to solve TSP for it.

    $222 (Avg Bid)
    $222 Avg Bid
    3 bids

    Please check attachment for the details I need to complete this task

    $80 (Avg Bid)
    $80 Avg Bid
    9 bids

    Simple Haskell it is, will share the details.

    $36 (Avg Bid)
    $36 Avg Bid
    7 bids

    La nostra azienda cerca un programmatore per personalizzare l'autocad mechanical.

    $3470 (Avg Bid)
    $3470 Avg Bid
    2 bids

    i need convert a old personalization of autocad 2015 to autocad 2017

    $5477 (Avg Bid)
    $5477 Avg Bid
    3 bids

    its project between autocad and ms excel i have done the project in vba excel control the auto desk as draw points from excel to autodesk based on some formula i done . now i want change the software from excel to be component in auto desk .

    $153 (Avg Bid)
    $153 Avg Bid
    34 bids

    Looking to get some work done w/ Scheme using the R5RS implementation. Attached is the pdf. To be done in 48 hours after project acceptance.

    $117 (Avg Bid)
    $117 Avg Bid
    1 bids

    HE EXPLANATION AFTER THAT TRY TO USE HIS WAY AND COMMAND ( LOOK UNDER THIS TITLE Wed 10/18/17 Code: 57370 this is the questions : ==> (poke 3 'hello) (one two hello three four) ==> (peek 3) hello ==> (purge 3) (one two three four) ==> (pokeload) Enter new items and then type END: five six seven end (one two three four five six seven) ==> (present) one two three four five six seven () I want you to write defune for each 5 questions please use the code in the note example for answer ==> (defun tens (mylist) (cond ((null mylist) '(() () ())) (t (list (cons (* (car mylist) 10) (car (tens (cdr mylist))) ) (cons (* (car mylist) 50) (cadr (tens (cdr mylist))) ) (cons (* (car mylist) 100) (caddr (tens (cdr mylist))) ) ) ) ) ) please just use the code in the notes thank you Attachments area

    $24 (Avg Bid)
    $24 Avg Bid
    3 bids

    You need to know the racket language to work on this project. Scheme was chosen as the skill as both languages are nearly identical. Please take a look at the PDF file for details regarding the task. This is a very simple task. It should only take you 1-2 hours if you are experienced. Instructions need to be followed carefully. All code should be commented/documented properly. I need this completed in 48 hours.

    $50 (Avg Bid)
    $50 Avg Bid
    1 bids

    Alll the details will be provided upon the bid

    $34 (Avg Bid)
    $34 Avg Bid
    8 bids
    Common LISP Ended

    I have a tiny 40KB common lisp program. I am looking for someone to translate it into Matlab. It's about computation. Only experience programmer please. Thank You

    $156 (Avg Bid)
    $156 Avg Bid
    6 bids
    LISP/Prolog Project Ended

    Develop a rule-based system which handles some classification or diagnostics. system should be based on rule-base with 30 rules. I'll send the rest details.

    $66 (Avg Bid)
    $66 Avg Bid
    3 bids

    I need a small Prolog and Lisp project done for research purposes.

    $58 (Avg Bid)
    $58 Avg Bid
    7 bids
    LISP Project Ended

    It is a LISP Project. I will give more details later.

    $20 (Avg Bid)
    $20 Avg Bid
    1 bids
    LISP Expert Ended

    I need a Lisp Programming expert for my current projects. If you have knowledge please bid. Details will be shared in message with the freelancers.

    $8 - $54
    $8 - $54
    3 bids

    Hi, Here is my project require lisp knowledge. Please read the pdf file in zip and let me know if u can do it. Thanks.

    $148 (Avg Bid)
    $148 Avg Bid
    3 bids

    expert in LISP and Matlab to convert a code

    $32 (Avg Bid)
    $32 Avg Bid
    6 bids

    I am looking for a private CS:GO cheat coder that can make me a one of one cheat and can update it at any time for no more than $150

    $147 (Avg Bid)
    $147 Avg Bid
    5 bids

    implement huffman libraries lisp prolog imht-decode bits huffman-tree message ht-encode message huffman-tree bits ht-encode-file filename huffman-tree bits ht-generate-huffman-tree symbols-n-weights huffman-tree ht-generate-symbol-bits-table huffman-tree symbol-bits-table ht-pprint-huffman-tree huffman-tree &optional (indent-level 0) huffman-tree is a Huffman tree (its root); symbols-n-weigths is a list of pairs of symbol-weight (<symbol>. <weight>); symbol-bits-table is a list of pairs (<symbol>. <bits>). The ht-encode-file function reads a text from a file and then invokes ht-encode on the read. Functions must generate errors (with the function error) if encoding and / or decoding are not possible. The ht-print-huffman-tree function prints a Huffman Tree terminal and serves essentially for debugging. No perticular format is required, but printed information has to be fine represent the tree structure of Huffman Prolog You must implement the following predicates: ht_decode / 3 Bits HuffmanTree Message ht_encode / 3 Message HuffmanTree Bits ht_encode_file / 3 Filename HuffmanTree Bits ht_generate_huffman_tree / 2 SymbolsAndWeights HuffmanTree ht_generate_symbol_bits_table / 2 HuffmanTree SymbolBitsTable ht_pprint_huffman_tree / 1 HuffmanTree The constraints are the same as above (obviously remodeled in Prolog). In particular, Symbolic pairs and bits symbol are represented as pairs lists of two elements (i.e., (<symbol>, <weight>) and (<symbol>, <bits>)). Predicates must fail if there are errors or if they encode and / or decoding can not be completed. The predicate ht_print_huffman_tree prints a Huffman Tree terminal. Examples The most important example to keep in mind (the specification, according to a more correct terminology) is the following. In Common Lisp: cl-prompt> (defparameter ht (ht-generate-huffman-tree '<symbols-n-weights>)) HT cl-prompt> (defparameter message '<some-message>) MESSAGE cl-prompt> (equal message (ht-decode (ht-encode message ht ht)) T In Prolog: ? - assert (symbols_n_weights (<symbols-n-weights>)). Yes. ? - assert (message (<some-message>)). Yes. ?- symbol_n_weights(SWs), | message(M), | ht_generate_huffman_tree(SWs, HT), | ht_encode(M, HT, Bits), | ht_decode(Bits, HT, M). Yes. As you may have noticed, the structure of the implementation of a tree has not been specified Huffman. A problem you will have will be in managing ordered sets of elements (leaves and tree nodes in construction); you will need to implement a structure and / or functions that keep them together ordered. The implementation of the various functions and predicates is relatively simple once it is exploited the sorting of knots and leaves. If you find yourself writing features or long predicates or complex then you are probably on the wrong track..

    $249 (Avg Bid)
    $249 Avg Bid
    2 bids

    Looking for someone to help me with clipper application. I have a procedure that is giving me a memory error The freelancer must be good at compiling and adjusting code Time-frame: ASAP

    $155 (Avg Bid)
    $155 Avg Bid
    1 bids

    Top Lisp Community Articles