Filters








142,563 Hits in 4.3 sec

A Benchmark for Online Non-blocking Schema Transformations

Lesley Wevers, Matthijs Hofstra, Menno Tammens, Marieke Huisman, Maurice van Keulen
2015 Proceedings of 4th International Conference on Data Management Technologies and Applications  
This paper presents a benchmark for measuring the blocking behavior of schema transformations in relational database systems.  ...  Based on these transformations and our criteria, we have developed a benchmark that extends the standard TPC-C benchmark with schema transformations, which can be used to analyze the blocking behavior  ...  INTRODUCTION For applications storing data in a database, changes in requirements often lead to changes in the database schema.  ... 
doi:10.5220/0005500202880298 dblp:conf/data/WeversHTHK15 fatcat:ypowcfriofabbjqdjrl7sxuili

Using Column Generation to Solve Extensions to the Markowitz Model [article]

Lorenz M. Roebers, Aras Selvi, Juan C. Vera
2019 arXiv   pre-print
We solve such type of problems using a method similar to column generation.  ...  In this scheme, the original problem is restricted to a subset of the assets resulting in a master convex quadratic problem.  ...  We propose a novel methodology based on a column generation approach to quadratic optimization problems. To do this the constraints are divided into two groups.  ... 
arXiv:1812.00093v4 fatcat:egbq7y3m4vae5dszp3hkyeztqm

Solving Problems with CP: Four Common Pitfalls to Avoid [chapter]

Jean-Charles Régin
2011 Lecture Notes in Computer Science  
Constraint Programming (CP) is a general technique for solving combinatorial optimization problems.  ...  Mainly, there are: the abstraction of interesting and relevant subparts, the definition of benchmarks and design of a global model and the application of a particular search strategy.  ...  For instance, the subpart may not include an important constraint and be easy to solve in this context, whereas in the whole problem the introduction of the missing constraint will totally change the difficulty  ... 
doi:10.1007/978-3-642-23786-7_3 fatcat:mizoer5yuffj5jip5tfvlqqmdy

Solving disjunctive temporal problems with preferences using maximum satisfiability

Marco Maratea, Luca Pulina
2012 AI Communications  
Moffitt, Bart Peintner, Christian Herde, Bruno Dutertre and Albert Oliveras for discussions about, and/or getting support to, their solvers, and Hyondeuk Kim for details about the jobshop benchmarks.  ...  We would also like to thank Adrian Kügel, Michael D.  ...  The table consists of nine columns: the first one reports the group of benchmarks (column "Instance"), and it is followed by four groups of columns, organized similarly to Table 4 . analysis in literature  ... 
doi:10.3233/aic-2012-0527 fatcat:ld46gaqqibetrpjbhas2acox4e

Hypergraph partitioning with fixed vertices [VLSI CAD]

C.J. Alpert, A.E. Caldwell, A.B. Kahng, I.L. Markov
2000 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
We find that the presence of fixed terminals can make a partitioning instance considerably easier (possibly to the point of being "trivial"); much less effort is needed to stably reach solution qualities  ...  Our experimental testbed incorporates a leading-edge multilevel hypergraph partitioner and IBM-internal circuits that have recently been released as part of the ISPD-98 Benchmark Suite.  ...  For preplaced constraint, we require a module to be placed exactly at a certain position in the final packing.  ... 
doi:10.1109/43.828555 fatcat:idxsrdu2crdclg7tbcqiex6thy

A Novel Heuristic and Provable Bounds for Reconfigurable Architecture Design

Alastair Smith, George Constantinides, Peter K. Cheung
2006 2006 International Conference on Field Programmable Logic and Applications  
In particular, we investigate the appropriate mix and floorplan of heterogeneous elements: multipliers, RAMs, and LUT-based logic, in order to maximise the performance of a set of DSP benchmark applications  ...  We extend our previous mathematical programming framework by proposing a novel set of heuristics, capable of providing upper-bounds on the achievable reconfigurable-to-fixed-logic performance ratio.  ...  In a standard k-means problem, there are no constraints on the node locations; the introduction of these constraints means that the clustering of each node has to be verified.  ... 
doi:10.1109/fpl.2006.311261 dblp:conf/fpl/SmithCC06 fatcat:zte63vvuhvd7fdqu7lqjm3hlyq

A Novel Hueristic and Provable Bounds for Reconfigurable Architecture Design

Alastair Smith, George Constantinides, Peter K. Cheung
2006 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines  
In particular, we investigate the appropriate mix and floorplan of heterogeneous elements: multipliers, RAMs, and LUT-based logic, in order to maximise the performance of a set of DSP benchmark applications  ...  We extend our previous mathematical programming framework by proposing a novel set of heuristics, capable of providing upper-bounds on the achievable reconfigurable-to-fixed-logic performance ratio.  ...  In a standard k-means problem, there are no constraints on the node locations; the introduction of these constraints means that the clustering of each node has to be verified.  ... 
doi:10.1109/fccm.2006.11 dblp:conf/fccm/SmithCC06 fatcat:q6ulsixysjau7mptdiidfhxtlq

An Ant-Based Solver for Subset Problems

Broderick Crawford, Carlos Castro, Eric Monfroy
2009 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies  
In this paper, we solve some benchmarks of them with Ant Colony Optimization using a new transition rule. A Lookahead mechanism was incorporated to check constraint consistency in each iteration.  ...  Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization.  ...  In this work, we solve some benchmarks of them with Ant Colony Optimization (ACO) algorithms and some hybridizations of ACO with a Constraint Programming (CP) technique: Forward Checking.  ... 
doi:10.1109/act.2009.74 fatcat:37vp4tkk5zdhzi7ourax5t5ble

Exploring Properties of Icosoku by Constraint Satisfaction Approach [article]

Ke Liu, Sven Löffler, Petra Hofstedt
2019 arXiv   pre-print
In addition, we also present a constraint programming model for the proposed questions, which can provide the answers to our first two questions.  ...  The purpose of this paper is to share our preliminary result and problems to encourage researchers in both group theory and constraint communities to consider this topic further.  ...  We should like to thank our colleague Ekkehard Köhler for drawing our attention to the icosoku problem.  ... 
arXiv:1908.06003v1 fatcat:zrsz2o6wurbwvnpqjkqboznvpu

N-version temperature-aware scheduling and binding

Yousra Alkabani, Farinaz Koushanfar, Miodrag Potkonjak
2009 Proceedings of the 14th ACM/IEEE international symposium on Low power electronics and design - ISLPED '09  
Our experimental evaluation shows a very low overhead and an average 5% decrease in the steady-state peak temperature produced on the benchmark designs compared to using a schedule that balances the amount  ...  Technology scaling to nanometer nodes causes growing increase in power density and especially leakage that in turn result in locally hot regions on the chip.  ...  The first column shows the benchmark name. The second and third columns show the number of ALUs and Multipliers used in each benchmark.  ... 
doi:10.1145/1594233.1594315 dblp:conf/islped/AlkabaniKP09 fatcat:5hjt3porybdqzlpe7q6ioyqb5u

COBALT: constraint-based alignment tool for multiple protein sequences

J. S. Papadopoulos, R. Agarwala
2007 Bioinformatics  
We also show that COBALT has reasonable runtime performance and alignment accuracy comparable to or exceeding that of other tools for a broad range of problems.  ...  COBALT finds a collection of pairwise constraints derived from database searches, sequence similarity and user input, combines these pairwise constraints, and then incorporates them into a progressive  ...  A web page developed by Irena Zaretskaya to run the COBALT algorithm has been helpful in jump-starting activity on linking COBALT with other applications at NCBI.  ... 
doi:10.1093/bioinformatics/btm076 pmid:17332019 fatcat:a6h7n3la5nfm3lcqjwayce37u4

Correcting for the free energy costs of bond or angle constraints in molecular dynamics simulations

Gerhard König, Bernard R. Brooks
2015 Biochimica et Biophysica Acta - General Subjects  
For the alanine to serine case, the phase space overlaps of the unconstrained simulations range between 0.15 and 0.9%. The introduction of constraints increases the overlap up to 2.05%.  ...  Methods-The free energy costs of applying or removing constraints are calculated as additional explicit steps in the free energy cycle.  ...  Acknowledgments The authors would like to thank Tim Miller, Stefan Boresch, Yihan Shao, Alex Sodt and Lee Woodcock for insightful discussions, as well as Frank Pickard and Noreen Gervasi for critically  ... 
doi:10.1016/j.bbagen.2014.09.001 pmid:25218695 pmcid:PMC4339525 fatcat:b2wqjkhoybcffd4s6m75uo4db4

A Fast Approximation Algorithm for MIN-ONE SAT

Lei Fang, Michael S. Hsiao
2008 2008 Design, Automation and Test in Europe  
In this paper, we propose a novel approximation algorithm (Re-laxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search.  ...  The constraints are gradually relaxed to eliminate the conflicts with the original Boolean SAT formula until a solution is found.  ...  A set of constraints automatically derived from the objective function is used to guide the search.  ... 
doi:10.1109/date.2008.4484921 dblp:conf/date/FangH08 fatcat:66q2w7chfzbs5d4bcwivuadtmi

Optimal Rectangle Packing: An Absolute Placement Approach

E. Huang, R. E. Korf
2013 The Journal of Artificial Intelligence Research  
Our packer allows us to extend the known solutions for a consecutive-square benchmark from 27 to 32 squares.  ...  To determine the y-coordinates, we branch on the different rectangles that can be placed in each empty position.  ...  This research was funded in part by the National Science Foundation under grant number IIS-0713178.  ... 
doi:10.1613/jair.3735 fatcat:oadd6u4a3vcupfdouofiyflzei

Inference and declaration of independence

Foivos S. Zakkak, Dimitrios Chasapis, Polyvios Pratikakis, Angelos Bilas, Dimitrios S. Nikolopoulos
2012 Proceedings of the 21st international conference on Parallel architectures and compilation techniques - PACT '12  
We implemented these optimizations in SCOOP, a source-to-source compiler for such a programming model and runtime system.  ...  We use a static dependence analysis to detect nonconflicting tasks and remove unnecessary runtime checks.  ...  Note that Ferret, the largest benchmark, creates the largest constraint graph, causing an analysis time of over 11 minutes, as context sensitive analysis is cubic in the size of the constraint graph.  ... 
doi:10.1145/2370816.2370892 dblp:conf/IEEEpact/ZakkakCPBN12 fatcat:ibqbfrnvmjf7bcufcy7gpl45m4
« Previous Showing results 1 — 15 out of 142,563 results