algorithms   65564

« earlier    

Visualizing Garbage Collection Algorithms
Developers take garbage collection for granted, but it's hard to see how it works. Watch 5 different GC algorithm visualizations.
algorithms  visualisation  compilers  garbage_collection  education  teaching 
yesterday by vloux
[1605.07493] Safely Optimizing Highway Traffic with Robust Model Predictive Control-based Cooperative Adaptive Cruise Control
Road traffic crashes have been the leading cause of death among young people. Most of these accidents occur when the driver becomes distracted due to fatigue or external factors. Vehicle platooning systems such as Cooperative Adaptive Cruise Control (CACC) are one of the results of the effort devoted to the development of technologies for decreasing the number of road crashes and fatalities. Previous studies have suggested such systems improve up to 273\% highway traffic throughput and fuel consumption in more than 15\% if the clearance between vehicles in this class of roads can be reduced to 2 meters. This paper proposes an approach that guarantees a minimum safety distance between vehicles taking into account the overall system delays and braking capacity of each vehicle. A l∞-norm Robust Model Predictive Controller (RMPC) is developed to guarantee the minimum safety distance is not violated due to uncertainties on the lead vehicle behavior. A formulation for a lower bound clearance of vehicles inside a platoon is also proposed. Simulation results show the performance of the proposed approach compared to a nominal controller when the system is subject to both modeled and unmodeled disturbances.
robotics  operations-research  planning  algorithms  performance-measure  rather-interesting  engineering-design  nudge-targets  consider:looking-to-see 
yesterday by Vaguery
LeetCode Online Judge
LeetCode Online Judge is a platform for preparing technical coding interviews and assessing your knowledge of data structures and algorithms. Pick from our expanding library of more than 160 interview questions to solve. Use our automated tool to get real time feedback on your solution.
career  learning  algorithms  interview  practice 
yesterday by rmsaksida
jomsdev notes:

'Last year, in the AofA’16 conference Robert Sedgewick proposed a new algorithm for cardinality estimation. Robert Sedgwick is a professor at Princeton with a long track of publications on combinatorial/randomized algorithms. He was a good friend of Philippe Flajolet (creator of Hyperloglog) and HyperBitBit it's based on the same ideas. However, it uses less memory than Hyperloglog and can provide the same results. On practical data, HyperBitBit, for N < 2^64 estimates cardinality within 10% using only 128 + 6 bits.'
algorithms  programming  cs  hyperloglog  estimation  cardinality  counting  hyperbitbit 
2 days ago by jm
[1604.01760] Solving Diophantine Equations
In this book a multitude of Diophantine equations and their partial or complete solutions are presented. How should we solve, for example, the equation {\eta}({\pi}(x)) = {\pi}({\eta}(x)), where {\eta} is the Smarandache function and {\pi} is Riemann function of counting the number of primes up to x, in the set of natural numbers? If an analytical method is not available, an idea would be to recall the empirical search for solutions. We establish a domain of searching for the solutions and then we check all possible situations, and of course we retain among them only those solutions that verify our equation. In other words, we say that the equation does not have solutions in the search domain, or the equation has n solutions in this domain. This mode of solving is called partial resolution. Partially solving a Diophantine equation may be a good start for a complete solving of the problem. The authors have identified 62 Diophantine equations that impose such approach and they partially solved them. For an efficient resolution it was necessarily that they have constructed many useful tools for partially solving the Diophantine equations into a reasonable time. The computer programs as tools were written in Mathcad, because this is a good mathematical software where many mathematical functions are implemented. Transposing the programs into another computer language is facile, and such algorithms can be turned to account on other calculation systems with various processors.
algebra  number-theory  rather-interesting  books  nudge-targets  consider:looking-to-see  algorithms  numerical-methods 
2 days ago by Vaguery
[1608.05578] Haploid-Diploid Evolutionary Algorithms
This paper uses the recent idea that the fundamental haploid-diploid lifecycle of eukaryotic organisms implements a rudimentary form of learning within evolution. A general approach for evolutionary computation is here derived that differs from all previous known work using diploid representations. The primary role of recombination is also changed from that previously considered in both natural and artificial evolution under the new view. Using well-known abstract tuneable models it is shown that varying fitness landscape ruggedness varies the benefit of the new approach.
genetic-algorithm  theoretical-biology  algorithms  metaheuristics 
2 days ago by Vaguery
[1102.2315] Cellular Automata and Discrete Geometry
In this paper, we look at the possibility to implement the algorithm to construct a discrete line devised by the first author in cellular automata. It turns out that such an implementation is feasible.
cellular-automata  nonstandard-computation  rather-interesting  algorithms  to-write-about  nudge-targets  consider:looking-to-see  consider:performance-measures 
2 days ago by Vaguery
[1208.3663] Space-Time Trade-offs for Stack-Based Algorithms
In memory-constrained algorithms we have read-only access to the input, and the number of additional variables is limited. In this paper we introduce the compressed stack technique, a method that allows to transform algorithms whose space bottleneck is a stack into memory-constrained algorithms. Given an algorithm \alg\ that runs in O(n) time using Θ(n) variables, we can modify it so that it runs in O(n2/s) time using a workspace of O(s) variables (for any s∈o(logn)) or O(nlogn/logp) time using O(plogn/logp) variables (for any 2≤p≤n). We also show how the technique can be applied to solve various geometric problems, namely computing the convex hull of a simple polygon, a triangulation of a monotone polygon, the shortest path between two points inside a monotone polygon, 1-dimensional pyramid approximation of a 1-dimensional vector, and the visibility profile of a point inside a simple polygon. Our approach exceeds or matches the best-known results for these problems in constant-workspace models (when they exist), and gives the first trade-off between the size of the workspace and running time. To the best of our knowledge, this is the first general framework for obtaining memory-constrained algorithms.
computational-complexity  algorithms  stacks  to-understand  computational-geometry  nudge  to-write-about 
2 days ago by Vaguery
[0806.0928] Drawing Binary Tanglegrams: An Experimental Evaluation
A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required that the individual trees are drawn crossing-free. A natural optimization problem, denoted tanglegram layout problem, is thus to minimize the number of crossings between inter-tree edges.
The tanglegram layout problem is NP-hard and is currently considered both in application domains and theory. In this paper we present an experimental comparison of a recursive algorithm of Buchin et al., our variant of their algorithm, the algorithm hierarchy sort of Holten and van Wijk, and an integer quadratic program that yields optimal solutions.
graph-layout  algorithms  visualization  optimization  rather-interesting  to-write-about  nudge-targets  consider:looking-to-see 
2 days ago by Vaguery
mathrecreation: polynomial grid division examples
There are not enough examples of polynomial division using the grid method out there. To remedy that, I have posted about 100 billion examples for your viewing pleasure. Please check ‘em out:

Jokes aside, I was looking for a small JavaScript project, and this one looked like it would be fun. It was, and I learned a few things by building it. The page will generate a small number of examples, but you can get a fresh batch by reloading. Each example is calculated on the fly, and rendered using MathJax. Currently, the displayed calculations look like this:
matrices  javascript  visualization  nudge-targets  to-write-about  algorithms 
2 days ago by Vaguery
TLA+ is a formal specification language developed to design, model, document, and verify concurrent systems.
concurrency  modeling  algorithms  learning  specs 
2 days ago by giorgio_v

« earlier    

related tags

@developer  academic_paper  advertising  ai  algebra  algorithm  amazon  analysis  approximation  art  autoencoders  automation  bbc  bias  bioinformatics  book  books  c++  cardinality  career  cellular-automata  clustering  compare-to-pareto-gp-features  compilers  computational-complexity  computational-geometry  computer  concurrency  consensus  consider:agents  consider:as-primitives  consider:blocks-in-a-plane  consider:classification  consider:generalization  consider:interestingness  consider:looking-to-see  consider:performance-measures  consider:performance-space-analysis  consider:representation  consider:robustness  consider:violating-constraints  constraint-satisfaction  content  cooperyvette  counting  course  coursera  cs  d3js  data_mining  datastructures  decisionmaking  decisions  dedupe  deeplearning  deepmind  dimension-reduction  distributed  ebook  ebooks  education  educational  emergent-design  engineer  engineering-design  estimation  exploitation  exploration  extremism  face  fail  fairness  farnamstreet  feature-construction  fft  fourier  fouriertransform  free  funny  game-theory  gameplaykit  games  garbage_collection  garbagecollection  generative-processes  genetic-algorithm  github  golang  google  graph-layout  graph-theory  graph_processing  graphics  hadoop  hash  have-written-about  healthcare  history  homework  hyperbitbit  hyperloglog  indie  interesting  interview  ios  java  javascript  learn  learning  learning_resources  lensless-imaging  link_prediction  lisp  low-level-programming  machine-learning  machinelearning  math  mathematics  maths  matrices  mechanism-design  metaheuristics  metrics  minmax  ml  modeling  network-theory  neuralnetworks  nhs  nonstandard-computation  nudge-targets  nudge  number-theory  numerical-methods  online  opensource  operations-research  optics  optimization  paxos  performance-measure  planning  practice  probability-theory  procedural  programming  project_ideas  psychology  purdy-pitchers  python  radar  raft  random-matrices  rather-interesting  read2of  recommendation_engine  recommendations  reference  review  robotics  science  search-algorithms  security  self-adjusting  self-organization  semi-supervised-learning  simple-but-hard-problems  social_media  social_networks  software  solutions  sort  sorting  specs  stacks  statistics  strings  swift  teaching  text  textbook  theoretical-biology  time-series  tips  to-understand  to-write-about  toolkit  tuning  tutorial  twitter  video  visualisation  visualization  youtube 

Copy this bookmark: