|
Browse All Reviews > Computing Methodologies (I) > Symbolic and Algebraic Manipulation (I.1) > Algorithms (I.1.2)
|
|
|
|
|
|
|
|
|
1-10 of 110
Reviews about "Algorithms (I.1.2)":
|
Date Reviewed |
|
The subset assignment problem for data placement in caches Ghandeharizadeh S., Irani S., Lam J. Algorithmica 80(7): 2201-2220, 2018. Type: Article
This paper gives an approximation algorithm for the subset assignment problem (SAP). Given a set of n items of varying sizes, a set of d bins of varying capacities, and a cost c(...
|
Mar 6 2019 |
|
H-index manipulation by merging articles van Bevern R., Komusiewicz C., Niedermeier R., Sorge M., Walsh T. Artificial Intelligence 240(C): 19-35, 2016. Type: Article
Whether we like it or not, various simplistic bibliometrics are increasingly being used by university administrators, funding agencies, and governments in a largely misguided attempt at optimization. As is well known, any kind of measu...
|
Jun 13 2017 |
|
Algorithms for computing backbones of propositional formulae Janota M., Lynce I., Marques-Silva J. AI Communications 28(2): 161-177, 2015. Type: Article
The backbone (also called “necessary variables” or “fixed assignments”) of a propositional formula φ is the set of literals that are true in all models of the formula. Put another way, t...
|
Oct 27 2016 |
|
Synthesis of list algorithms by mechanical proving Drămnesc I., Jebelean T. Journal of Symbolic Computation 69(C): 61-92, 2015. Type: Article
Program synthesis via extraction of programs from constructive proofs is now very well established, with a large literature base. There are still quite a few hurdles to overcome, but the meta-theory has been in place for quite some tim...
|
Jan 11 2016 |
|
On minimum sum of radii and diameters clustering Behsaz B., Salavatipour M. Algorithmica 73(1): 143-165, 2015. Type: Article
The minimum sum of radii (MSR) problem is that of finding the least possible sum of radii of (at most) k clusters covering a set V of n points, where the points form a graph whos...
|
Oct 8 2015 |
|
The (weighted) metric dimension of graphs: hard and easy cases Epstein L., Levin A., Woeginger G. Algorithmica 72(4): 1130-1171, 2015. Type: Article
Metric dimension (MD) optimization algorithms require computation in such areas as network verification, mastermind games, metric and digital geometry, image digitization, robot navigation, drug discovery, and combinatorics problems. T...
|
Aug 31 2015 |
|
Complexity estimates for two uncoupling algorithms Bostan A., Chyzak F., de Panafieu É. ISSAC 2013 (Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, Boston, ME, Jun 26-29, 2013) 85-92, 2013. Type: Proceedings
Uncoupling is the process of producing one (or several uncoupled) equivalent higher-order differential equation(s) from a matrix of first-order (coupled) differential equations Y’=MY, whe...
|
Feb 21 2014 |
|
Dijkstra, Floyd and Warshall meet Kleene Höfner P., Möller B. Formal Aspects of Computing 24(4-6): 459-476, 2012. Type: Article
We have recently seen quite a resurgence of interest in semirings and related algebraic structures. While mathematicians have known about these structures for a long time, as with monoids, they have not received much attention. They do...
|
Nov 13 2013 |
|
Speeding up CRC32C computations with Intel CRC32 instruction Gueron S. Information Processing Letters 112(5): 179-185, 2012. Type: Article
Gueron introduces an algorithm to speed up the CRC32C implementation using the corresponding central processing unit (CPU) CRC32 instruction from Intel to compute cyclic redundancy checks of an arbitrary length buffer with inputs rangi...
|
Jun 11 2012 |
|
Algebraic transformation of differential characteristic decompositions from one ranking to another Golubitsky O., Kondratieva M., Ovchinnikov A. Journal of Symbolic Computation 44(4): 333-357, 2009. Type: Article
The problem of efficiently transforming differential sets from one ranking to another is studied in this paper. The major advantage of the authors’ approach over other approaches is the fact that the most time-consuming part ...
|
Nov 10 2009 |
|
|
|
|
|
|