Search results

Create the page "Data Point" on this wiki! See also the search results found.

• Kd-tree
  ...re]] for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidimen ...cture use for ''k''-nearest neighbours searching in [[Dynamic Clustering]] data logging algorithms. Currently, the most popular type of kd-tree in Robocode
  4 KB (638 words) - 18:54, 4 October 2013
• Dynamic Clustering Attribute
  ...ituation. When several attributes are combined, it is then called a [[Data Point]]. ...he [[wikipedia:k-nearest neighbours|k-nearest neighbours]] of the recorded data points and then calculating the [[wikipedia:kernel density estimation|kerne
  908 bytes (113 words) - 06:33, 15 September 2017
• MissSurfing
  A crazy idea I had to add extra data to the regular surfing stats, by marking places on waves where you know the ...ite impossible to be implemented in a useful way, there is just too little data. --[[User:Rednaxela|Rednaxela]] 13:43, 13 April 2009 (UTC)
  4 KB (668 words) - 19:39, 13 April 2009
• Dookious/DookiLightning
  ...being fired every tick. If the rating for the Main Gun is above a certain point, there is a bias against selecting the AntiSurfer gun when comparing rating The Main Gun uses firing and non-firing waves to collect data. The non-firing waves are weighted less, but since this gun is generally ge
  12 KB (1,406 words) - 22:52, 22 April 2009
• Displacement Targeting
  Currently my version of the algorithm segments data by velocity (so if a robot is still, we predict one displacement. If it is For the purpose of data collection, each observed enemy location is stored along with a timestamp.
  4 KB (630 words) - 08:14, 21 November 2007
• Dookious/DookiSaberRRGC
  ...hting of main stat buffers is dependent on amount of data in them, up to a point. (Previously, they were weighted equally no matter what.) ** Data saving is off, so as to better compare to [[Ascendant/RRGC|AscendantRRGC]]
  4 KB (662 words) - 21:11, 7 May 2009
• RetroGirl
  ...or]] stored for that point. The locations and GuessFactor values for these data points were evolved using [[wikipedia:Genetic algorithm|genetic algorithms]
  3 KB (427 words) - 20:15, 10 August 2017
• NeuralMinimumRiskBot
  ...architectures based loosely on brain and used both in Machine Learning and Data Mining. boolean hitWhenGoing = true;//Did we hit a bullet while going to that point?
  9 KB (1,037 words) - 20:11, 11 August 2017
• BeepBoop
  ...example, it sometimes drives past and then reverses into the lowest danger point if that helps is get to a low-danger area on the next wave. The danger comp Aiming/movement data between rounds, nothing between matches.
  3 KB (472 words) - 23:28, 9 January 2024
• Tomcat
  ===== Data analysis ===== ...ercepted), enemy change velocity sign and Tomcat's distance to destination point is less than stop distance + 8.<br>
  6 KB (842 words) - 21:25, 9 August 2017
• Dynamic Clustering Tutorial
  ...sifies that data on-the-fly, because it's always re-examining the original data. === Translating to data points ===
  14 KB (2,154 words) - 17:24, 22 November 2013
• Targeting
  ...extbook won't work. The time you have needs to be split between collecting data and generating firing angles. ...en you have no data, when you have 50 ticks, 500 ticks, or 20,000 ticks of data, your algorithm has to perform well and remain fast.
  4 KB (587 words) - 01:16, 28 August 2017
• DeBroglie/Version History
  ** rev0073 - Accidentally included experimentally turning '''off''' culling data points via displacement vectors. ** rev0073b - Turned point culling back on. {{RumbleStatsDefault|link=http://darkcanuck.net/rumble/Rat
  6 KB (964 words) - 00:27, 17 July 2012
• WaveShark
  : Surfing and pattern matching data between rounds, nothing between matches. : I'm not sure! The gun is a weak point, but it's hard to find code size to make it better.
  2 KB (228 words) - 04:45, 19 January 2024
• NeuralTargetingBot
  :AbsoluteBearing takes the angle to a point from the source. ...ty = (enemyVelocity * Math.sin(e.getHeadingRadians() - absBearing));//Some data
  7 KB (765 words) - 14:19, 11 August 2017
• Fuzzy Logic Targeting
  ...ns based on imperfect data. It assigns a 'goodness' score for the 'perfect data' indicating something, and then picks the best score - that sounds like fuz ...echnique, but I don't see how slicing up the guess factor / bearing offset data more finely affects learning speed. Higher segmentation, definitely, but n
  6 KB (1,054 words) - 19:14, 1 April 2011
• HawkLA
  ...'s basically a normal linear targeting but also gets another velocity data point when it fires (at "max gun heat") then just divides those two velocities in
  2 KB (276 words) - 07:29, 26 November 2023
• Mint
  : Between rounds: KdTree movement data. KdTree firing data. : Not to that point in development yet.
  3 KB (477 words) - 09:17, 14 September 2017
• Drifter
  ...and to directly "surf" the [[Guess Factor]] data. It makes up guess factor data for the HOT, Linear and Circular predicted bullets, and basically does a si It searches only 37 points from an (-8..8, -8..8) square. The point are (successive diamond shapes where manhattan distance = {0, 4, 8, 12}, an
  5 KB (665 words) - 07:23, 15 June 2009
• Ant (tool)
  <!-- !!!!!!!!!!!!!!! NO CONFIGURATION BEYOND THIS POINT !!!!!!!!!!!!!!!!!!!! --> Bonus, it includes those in the data folder aswell. -->
  6 KB (741 words) - 02:09, 30 August 2011

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)