A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The UNSW RoboCup 2000 Sony Legged League Team
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
The UNSW team won both the challenge competition and all their soccer matches, emerging the outright winners for this league against eleven other international teams. ...
Vision Since all the objects on the field are colour coded, the aim of the first stage of the vision system is to classify each pixel into the eight colours on the field. ...
The initial design of the robot recognition algorithm was based upon a sample of 25 images of robots taken from the robot's camera, as well as manually measured distances to each of the robots in the samples ...
doi:10.1007/3-540-45324-5_5
fatcat:ezqnm6mhtjbjlm4vvd7tdv64xy
CAMBADA Soccer Team: from Robot Architecture to Multiagent Coordination
[chapter]
2010
Robot Soccer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here, from the candidate point to the center of the ball, it is performed a search of pixels at a distance r from the center. ...
This validation algorithm is based on two tests against which each ball candidate is put through. ...
It was impossible to cover all aspects of the research in detail but through the chapters of this book, various topics were elaborated. ...
doi:10.5772/7353
fatcat:6zzbkog7v5dobnup3kmn6ar3wi
Mega-KV
2015
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
store system on a conventional CPU-based platform. ...
Specifically, we present the design and implementation of Mega-KV, a GPU-based in-memory key-value store system that achieves high performance and high throughput. ...
Search: A Search operation checks all 2×N candidate key signatures in the two buckets, and writes the corresponding location into the output buffer. ...
doi:10.14778/2809974.2809984
fatcat:czfglweqhrhz5gdu65ojhdg4ou
Intelligent Autonomous Robotics: A Robot Soccer Case Study
2007
Synthesis Lectures on Artificial Intelligence and Machine Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
of the algorithms behind our own approach on the AIBOs with the goal of making them accessible for use on other vision-based and/or legged robot platforms. ...
ACKNOWLEDGMENT This lecture is based on the work and writing of many people, all from the UT Austin Villa RoboCup team. ...
Finally, we played one last practice match against Team Upsalla from Sweden and won 4-0. Based on all of our practice matches, we seemed to be one of the better new teams at the competition. ...
doi:10.2200/s00090ed1v01y200705aim001
fatcat:mnrq7oqbzrhttbwsogb3oo2qfm
Optimistic Concurrency Control for Real-world Go Programs (Extended Version with Appendix)
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A custom HTM library, using perceptron, learns concurrency behavior and dynamically decides whether to use HTM in the rewritten lock/unlock points. ...
We present a source-to-source transformation framework, GOCC, that consumes lock-based pessimistic concurrency programs in the Go language and transforms them into optimistic concurrency programs that ...
We also check that their points-to sets intersect. If no matches are found, we traverse up in the DomTree till a match is found and drop the candidate L if none is found. ...
arXiv:2106.01710v1
fatcat:joiitibajndepjgnxh5u67ykpy
Bottom-Up beta-Substitution: Uplinks and lambda-DAGs
2004
BRICS Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
<br /> <br />Besides being both fast and parsimonious of space, the algorithm is particularly suited to applications such as compilers, theorem provers, and type-manipulation systems that may need to examine ...
By adding uplinks from a child to its parents, we can efficiently implement beta reduction in a bottom-up manner, thus avoiding combinatorial explosion in time required to search the term in a top-down ...
Andrew Appel suggested to us the possibility of basing a programming-language semantics and implementation on the BUBS algorithm. ...
doi:10.7146/brics.v11i38.21863
fatcat:v6swqvjkljfnlcmk3iahorwugu
Beam Tests and Commissioning of Low Emittance Rings
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The present proceedings consist of summaries from the chairs of the seven workshop sessions, which are accompanied by individual contributions. ...
The workshop "Beam Tests and Commissioning of Low Emittance Storage Rings" was held at the KIT Campus South in Karlsruhe from 18 to 20 February 2019. ...
Zhang) and the members of the technical groups of DESY involved in the PETRA IV design for material for this contribution. ...
doi:10.5281/zenodo.3889902
fatcat:cfrc35tr6nakdafmffnfadc57i
Next generation routers
2002
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Several proposed algorithms for IP route lookup and packet classification are compared in respect to their search/update speeds and storage requirements. ...
This paper first points out the issues of building such routers, such as memory speed constraint, packet arbitration bottleneck, and interconnection complexity. ...
Given a point , the query algorithm proceeds downward from the root of the trie according to the bits of in the usual manner. ...
doi:10.1109/jproc.2002.802001
fatcat:abbtxhetq5hwdisgdqavfgi2y4
Fast Exact Hyper-graph Matching with Dynamic Programming for Spatio-temporal Data
2014
Journal of Mathematical Imaging and Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Graphs and hyper-graphs are frequently used to recognize complex and often non-rigid patterns in computer vision, either through graph matching or point-set matching with graphs. ...
An exact minimization algorithm is derived for this structure and ...
Briefly, we start with a full dictionary (all models) and proceed to remove conditionally the least significant models from the set, one at a time, while checking the performance variations on a validation ...
doi:10.1007/s10851-014-0503-6
fatcat:xh7yy4ivfjhkjjhluj62lltahu
Accurate, scalable in-network identification of p2p traffic using application signatures
2004
Proceedings of the 13th conference on World Wide Web - WWW '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We examine the performance of our application-level identification approach using five popular P2P protocols. ...
Our technique can significantly improve the P2P traffic volume estimates over what pure network port based approaches provide. ...
Data Sets We analyzed two full packet traces from different network vantage points using the Gigascope. ...
doi:10.1145/988672.988742
dblp:conf/www/SenSW04
fatcat:sl4wbjz4nnebffzkmpybagasu4
Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. ...
Under faults, both protocols maintain high throughput, but Narwhal-HotStuff suffers from increased latency. ...
Acknowledgments The majority of this work has beend done when the authors were part of the Novi team at Facebook. ...
arXiv:2105.11827v4
fatcat:ugkgku7n7jhzlnpo2tut5j66pe
AME Blockchain: An Architecture Design for Closed-Loop Fluid Economy Token System
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this white paper, we propose a blockchain-based system, named AME, which is a decentralized infrastructure and application platform with enhanced security and self-management properties. ...
The AME blockchain technology aims to increase the transaction throughput by adopting various optimizations in network transport and storage layers, and to enhance smart contracts with AI algorithm support ...
Stage 3: Candidate Block proposal Instructions for every node in FC: 3.1 After waiting an amount of time λ pc , node i votes the hash of the candidate block chosen from his received block proposals B r ...
arXiv:1812.08017v1
fatcat:m2tgekvu2jcnnbhxssob4xgh7i
A First-Passage Kinetic Monte Carlo algorithm for complex diffusion–reaction systems
2010
Journal of Computational Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The FPKMC algorithm presented here is based on the method introduced in [Phys. Rev. Lett., 97:230602, 2006] and is implemented in a robust and flexible framework. ...
The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. ...
Near-Neighbor Search Efficient particle-based algorithms use various geometric techniques to reduce to O(1) the cost of searching for the neighbors of a given particle. ...
doi:10.1016/j.jcp.2009.12.038
fatcat:6md64jrlajectf4ted3yxszen4
All at once: transient pulsations, spin down and a glitch from the Pulsating Ultraluminous X-ray Source M82 X-2
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we report the results of pulsation searches in all these datasets, and find only one new detection. ...
We discuss the new findings in the context of current leading models for PULXs. ...
We first used the accelsearch tool, that performs an accelerated search of pulsations based on the FFT and matched filters. ...
arXiv:1905.06423v2
fatcat:xbo3u33z5fav7apfbwe2wvs64y
Innovative applications of genetic algorithms to problems in accelerator physics
2013
Physical Review Special Topics. Accelerators and Beams
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Electron-Ion Collider at Jefferson Lab, and a radio frequency gun-based injector. ...
The genetic algorithm (GA) is a powerful technique that implements the principles nature uses in biological evolution to optimize a multidimensional nonlinear problem. ...
B depends on the ratio of two distances: the minimum from the parents to the edges of the search space and the full distance between the parents. ...
doi:10.1103/physrevstab.16.010101
fatcat:ttonzy7x3bbdhfsccm563r6f7e
« Previous
Showing results 1 — 15 out of 1,568 results