Tag : Complete
|Autocomplete with HTML5 datalist||MistaTwista||HTML||autocomplete||October 4|
|jQuery Ui Autocomplete, Custom ajax data||Cwerther||jQuery||autocomplete||
This is made for a webservice that outputs varaiable data according to user input, ajax is called each time there is a change on the input.
|June 17, 2011|
|first step for competion from git status output||skyboy||Bash||bashgitautocomplete||March 24, 2011|
|Find all three digit complete couple numbers||wartech||C||Find three digit complete couple numbers||This program will find all 3 digit numbers that are complete couples.A complete couple number is equal to the sum of all unique couplings of its digits. For example one complete couple would be 132. This number when rearranged by couples yields the following unique pairs: 13+12+31+32+21+23 = 132.||March 1, 2011|
|Java2sAutoTextField : non-strict default setting||studioevoque||Java||auto-complete||
This is a modification of the Sun tutorial code that initializes the text editor to accept words that are not part of the auto-complete list. In the terms of the implementation, it is referred to as "not strict".
|October 17, 2010|
|Handle Document Complete||p p||C#||Handle Document Complete||Sets up event to handle browser control document complete||May 12, 2010|
|Drupal Autocomplete Auto Submit||unravelme1||jQuery||autocomplete||
This overrides a couple core Drupal functions in the autocomplete.js file. It changes the behavior of the autocomplete such that if a user selects an item from the autocomplete menu, it takes them directly to that node instead of just populating the search field.
Please note that this implementation is not totally bulletproof; as you can see, there is a little bit of jank happening in Drupal.jsAC.prototype.select to check if the item is numeric. This is because I had to pull the nid from the input field, not from the jQuery object as desired. If anyone has a solution for this, please leave a comment.
|April 8, 2010|
|Autocomplete - Custom Filtering||neltro xastro||XAML||Autocomplete Custom Filtering||Silverlight3 - Autocomplete - Custom Filtering||November 24, 2009|
|Autocomplete||neltro xastro||XAML||Autocomplete||Silverlight3 - Autocomplete||November 24, 2009|
|Partition Problem and natural selection||Jai Vikram Singh Verma||python||approximate_solution complete crossover easiest_hard_problem generations genetic_algorithms natural_selection np np_complete np_hard optimal_solution partition_problem||
Partition problem From Wikipedia, the free encyclopedia
In computer science, the partition problem is an NP-complete problem. The problem is to decide whether a given multiset of integers can be partitioned into two "halves" that have the same sum. More precisely, given a multiset S of integers, is there a way to partition S into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2? The subsets S1 and S2 must form a partition in the sense that they are disjoint and they cover S. The optimization version asks for the "best" partition, and can be stated as: Find a partition into two subsets S1,S2 such that max(sum(S_1), sum(S_2)) is minimized (sometimes with the additional constraint that the sizes of the two sets in the partition must be equal, or differ by at most 1).
The partition problem is equivalent to the following special case of the subset sum problem: given a set S of integers, is there a subset S1 of S that sums to exactly t /2 where t is the sum of all elements of S? (The equivalence can be seen by defining S2 to be the difference S − S1.) Therefore, the pseudo-polynomial time dynamic programming solution to subset sum applies to the partition problem as well.
Although the partition problem is NP-complete, there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called the "The Easiest Hard Problem" by Brian Hayes.
|October 26, 2009|
|Retreive the complete list of Ports||syfran||Bash||Retreive complete list Ports||Download and extract the complete list of ports ( official and unofficial ) from Wikipedia||September 19, 2009|
|Disabling a Button Until Processing is Complete||Chanakya Jayabalan||HTML||Disabling Button Until Processing Complete||Disabling a Button Until Processing is Complete||August 4, 2009|
|A Complete URL Rewriting Solution for ASP.NET 2.0||Rajeev Jain||C#||Complete Rewriting Solution ASP.NET||A Complete URL Rewriting Solution for ASP.NET 2.0||July 1, 2009|
|Evolution optimization strategy||Agnius Vasiliauskas||python||ai evolution evolution_strategy gene genetic_algorithm np_complete optimization||
Algorithm for solving search and optimization problems.
|February 8, 2009|
|Disable AutoComplete on HTMl Forms||Carlos Cervantes||ActionScript||Disable AutoComplete HTMl Forms||Disables Auto Complete on Html TextBoxes.||November 10, 2008|