18,800 Hits in 10.2 sec

A Little More, a Lot Better: Improving Path Quality by a Simple Path Merging Algorithm [article]

Barak Raveh, Angela Enosh, Dan Halperin
2010 arXiv   pre-print
We introduce a simple algorithm for merging an arbitrary number of input motion paths into a hybrid output path of superior quality, for a broad and general formulation of path quality.  ...  We show that our algorithm is able to merge a handful of input paths produced by several different motion planners to produce output paths of much higher quality.  ...  This work has been supported in part by the Israel Science Foundation (grant no. 236/06), by the German-Israeli Foundation (grant no. 969/07), and the Hermann Minkowski-Minerva Center for Geometry at Tel  ... 
arXiv:1001.2391v2 fatcat:jeyvqiitunae7kwrnpn5aahuze

The Ongoing Challenge – Improving Organizational Performance with Better Decisions [chapter]

Kenneth Fordyce
2010 Proceedings of the 2009 SIAM Conference on "Mathematics for Industry"  
Every organization has as a stated goal to "make smarter decisions". However, each decision is a result of a complex interaction between process (culture), data, and the models (math) used.  ...  a look back at the Ptolemaic model of the universe in terms of "selling" the model.  ...  However, the scale (Milne 2010) of the enterprise problem is too large to be solved by a single LP model. Simple heuristics such as greedy algorithms can handle the scale.  ... 
doi:10.1137/1.9781611973303.3 fatcat:v7qavhixsfauxlkgeccg23y7rm

A better heuristic for orthogonal graph drawings

Therese Biedl, Goos Kant
1998 Computational geometry  
Linear time and space algorithms for drawing biconnected planar graphs orthogonally with at most 2n + 4 bends on a grid of size n x n are known in the literature.  ...  The algorithm handles both planar and non-planar graphs at the same time.  ...  We provide three appendices, where we show how to compute a special planar embedding and st-ordering, how to improve the algorithm a little for simple graphs, and where we give a detailed example for a  ... 
doi:10.1016/s0925-7721(97)00026-6 fatcat:gapyx3qg3zamnmgd3cn6h6igfm


Kajal Bholashankar Jaiswal, Master of Computer Engineering Thakur College of Engineering and Technology Mumbai, India, Dr. Harshali Patil
2020 International Journal of Advanced Research in Computer Science  
While at a single-family house cost desire, it needs more exact procedure reliant on the spot, house type, size, structure year, close by improvements, and some various parts which could impact house demand  ...  By analysing the earlier item, entry ranges and besides alerts enhancements, guessed costs will be evaluated.  ...  In any case, applying PCA did not improve the figure botch. A lot of assessment has been done on ANN (Artificial Neural Networks).  ... 
doi:10.26483/ijarcs.v11i6.6668 fatcat:cqo6ezxtofa7vivk2oyz7ilkc4

Unearthing inter-job dependencies for better cluster scheduling

Andrew Chung, Subru Krishnan, Konstantinos Karanasos, Carlo Curino, Gregory R. Ganger
2020 USENIX Symposium on Operating Systems Design and Implementation  
In simulations driven by real job logs, we find that a traditional YARN scheduler that uses Wing-provided valuations in place of user-specified priorities extracts more value (in terms of successful dependent  ...  The Wing dependency profiler analyzes job and data provenance logs to find hidden inter-job dependencies, characterizes them, and provides improved guidance to a cluster scheduler.  ...  jobs impact a lot more jobs and users than others.  ... 
dblp:conf/osdi/ChungKKCG20 fatcat:d33fggm7urdcvku5n4g3tpodr4

If in Doubt, Try Three: Developing Better Version Control Commit Behaviour with First Year Students

Amanda Berg, Simon Osnes, Richard Glassey
2022 Technical Symposium on Computer Science Education  
Results showed that students improved their commit behaviour in terms of number of commits, starting earlier with their assignments and writing more meaningful commit messages when compared to the rest  ...  Qualitative results showed that students were mostly positive towards developing better commit behaviour and felt that the extra effort to think in commits delivered proportionally more benefits for their  ...  There was a marked improvement in the quality of commit messages when comparing the test and control groups, showing that students adopted better practice.  ... 
doi:10.1145/3478431.3499371 dblp:conf/sigcse/BergOG21 fatcat:fo7oewsiqbe45ntyhunoz2snma

'Boxing' Choices for Better Dispute Resolution

Marc Lauritsen
2014 International Journal of Online Dispute Resolution  
This article explores opportunities for interactive visualizations in support of such processes, using as background a current software project that is developing systems for collaborative deliberation  ...  The Value-Add of Choice-Making Tools Choiceboxing can be done, in principle, with little more technology than a pencil and paper.  ...  After lots of discussion, the choice seems to hinge on three factors: completeness of features, quality of interface and ease of learning.  ... 
doi:10.5553/ijodr/2014001001005 fatcat:mzm63krguvb5dj3ibkuomeq2va

Memory leads the way to better computing

H.-S. Philip Wong, Sayeef Salahuddin
2015 Nature Nanotechnology  
in advancing computing by a thousandfold by 2015.  ...  Further, the report itself was assembled in just a few months at the beginning of 2008 from input by the participants.  ...  Chapter 5 tries to get a better handle on this as we scale algorithms up.  ... 
doi:10.1038/nnano.2015.29 pmid:25740127 fatcat:d6iiuuwcozbxlgn4kxxzdzwd4m

Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging [article]

Patrick Rodler
2017 arXiv   pre-print
The obtained picture gives a hint about which measures are more favorable in which situation or which measures always lead to the same outcomes, based on given types of queries.  ...  We tackle this issue by an in-depth mathematical analysis of diverse real-valued active learning query selection measures in order to determine qualitative criteria that make a query favorable.  ...  Therefore, minimizing D * dev by one improves RIO by more than an improvement of a query's entropy measure ENT could ever do.  ... 
arXiv:1609.02584v2 fatcat:ygxp4ulzjbhedjhhdlcys4lfbq

Network Compression by Node and Edge Mergers [chapter]

Hannu Toivonen, Fang Zhou, Aleksi Hartikainen, Atte Hinkka
2012 Lecture Notes in Computer Science  
We study the properties of these problems and outline a range of algorithms to solve them, with different trade-offs between complexity and quality of the result.  ...  The interpretation (i.e. decompression) of a compressed graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge equals the  ...  This work has been supported by the Algorithmic Data Analysis (Algodan) Centre of Excellence of the Academy of Finland (Grant 118653) and by the European Commission under the 7th Framework Programme FP7  ... 
doi:10.1007/978-3-642-31830-6_14 fatcat:3gb7fyjmzrevrkx5tupp2rr6sm

Exploring heterogeneous computing with advanced path tracing algorithms

Andre Oliveira, Cesar Perdigao, Luis Paulo Santos, Alberto Proenca
2016 2016 23° Encontro Português de Computação Gráfica e Interação (EPCGI)  
It also shows how these are combined together to perform heterogeneous computation managed by a simple scheduling algorithm, created to take advantage of each device's features.  ...  This work proved that a fully heterogeneous approach to these four path tracing algorithms is feasible and the performance results are significantly improved. ii R E S U M O Atualmente, muitos dos sistemas  ...  This increases the convergence rate, hence the number of samples needed to obtain a image with better quality is reduced.  ... 
doi:10.1109/epcgi.2016.7851185 fatcat:xyxt4d7yqvhp5giaq4dyi7zawy

Unlocking Big Data for better health

Steven Munevar
2017 Nature Biotechnology  
In summer of 2014, we started work on a simple datasubmission tool.  ...  The new design has several advantages, notably: There is no single point of failure; dual paths are available for all devices that support this feature; there is a 160 gigabyte/second path between any  ... 
doi:10.1038/nbt.3918 pmid:28700551 fatcat:oqiurm5cgzec7lfenvjvlemxoy

Compression of weighted graphs

Hannu Toivonen, Fang Zhou, Aleksi Hartikainen, Atte Hinkka
2011 Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '11  
We study the properties of these problems and propose a range of algorithms to solve them, with different balances between complexity and quality of the result.  ...  The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge  ...  Without loss of generality, we assume that the value of any path quality function is positive, and that a larger value of q indicates better quality.  ... 
doi:10.1145/2020408.2020566 dblp:conf/kdd/ToivonenZHH11 fatcat:qstzqslltfhm3ntcr2v4me7u64

Multi-scale capability: A better approach to performance measurement for algorithmic trading

Ricky Cooper, Michael Ong, Ben Van Vliet
2015 Algorithmic Finance  
By adapting capability from the quality control literature, we present new criteria for assessing control, expected tail loss and risk-adjusted performance in a single framework.  ...  The multi-scale capability measure we present is more descriptive and more appropriate for algorithmic trading than the traditional measure used in finance.  ...  Therefore, to accomplish this task we have developed a process that merges ideas from both finance and quality management.  ... 
doi:10.3233/af-150043 fatcat:23xdntmctfdmva2rytsq37d5lm

Rapidly exploring random graphs: motion planning of multiple mobile robots

Rahul Kala
2013 Advanced Robotics  
(d) While the proposed algorithm is computationally more expensive as compared to RRT (and variants) with every robot's path computed independently by an independent processor, the total processing required  ...  (c) In terms of path length, the proposed algorithm is better in terms of both global and local optimality as compared to RRT and its variants.  ...  The motivation is to add a little computation to RRT (for the case of a single robot) to significantly improve the path cost, which is modeled by bridging behavior.  ... 
doi:10.1080/01691864.2013.805472 fatcat:ir5gea6vcbhubgmalggxv5fxpy
« Previous Showing results 1 — 15 out of 18,800 results