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
A view of local search in constraint programming
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
More generally, how can a statistical prediction of an instance's objective function and/or feasibility value be useful in a solver? (c) How can we measure progress in a complete search trajectory? ...
By furthering the automation of search for combinatorial problem solving, this workshop should have a direct impact on the range and size of industrial problems that we will be able to solve with this ...
Lessons from MIP Search-Summary of Talk (J. N. Hooker) Mixed integer programming (MIP) offers several ideas that can benefit search in general. ...
doi:10.1007/3-540-61551-2_86
fatcat:dv47xzm7n5dgtg6yyst3vfrxf4
Improved Tool Support for Machine-Code Decompilation in HOL4
[chapter]
2015
Lecture Notes in Computer Science
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.
As a result of these improvements, decompilation is faster (on average by one to two orders of magnitude), the instruction set specifications are easier to write, and the proof tools are easier to maintain ...
These advancements have been facilitated by the development of a domain specific language, called L3, for the specification of Instruction Set Architectures (ISAs). ...
A notable change to the new specification is with regard to the specification of unpredictable and undefined 12 instruction instances. ...
doi:10.1007/978-3-319-22102-1_12
fatcat:xrbtb3mlrzezrddt2zrci2rl54
MiningZinc: A declarative framework for constraint-based mining
2017
Artificial Intelligence
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.
This leads to a unique combination of declarative modeling with high-performance solving. ...
The high-level problem specification is first translated into a normalized constraint language (FlatZinc). ...
In order to analyze the power of MiningZinc, we now focus on a more complex model that involves solving two well-studied problems from constraint-based mining: high-utility mining and discriminative pattern ...
doi:10.1016/j.artint.2015.09.007
fatcat:vkgau2uptzeeddzz2fmsc5ixva
Achieving an optimal trade-off between revenue and energy peak within a smart grid environment
2016
Renewable Energy
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.
Renewable Energy, Elsevier, 2016. hal-01230915 Achieving an optimal trade-off between revenue and energy peak within a smart grid environment Abstract In this paper, we consider an energy provider whose ...
Achieving an optimal trade-off between revenue and energy peak within a smart grid environment. ...
8.90
56.60 0.00% 0.00%
0
0
1000 17.90
63.00 0.00% 0.00%
0
0
Table 4 : 4 Comparison of models MP and CP with 100% TWW Instances Av Comp Time
Av Gap
# unsolved
(κ)
MP
CP
MP
CP
MP CP ...
doi:10.1016/j.renene.2016.01.055
fatcat:awc3oxtnozhi3mqrobwouiiaoe
Predictive Machine Learning of Objective Boundaries for Solving COPs
2021
AI
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
In this paper, we first give an overview of the existing body of knowledge on ML for Constraint Programming (CP), which learns from problem instances. ...
Third, we present an experimental study with distinct CP solvers on seven COPs. Our results show that near-optimal boundaries can be learned for these COPs with only little overhead. ...
, deg µ deg , dom−µ dom σ dom , and deg−µ deg σ deg Several studies have been performed to analyze the ability of these generic features to characterize and discriminate COP characteristics [19, [36] ...
doi:10.3390/ai2040033
fatcat:qzmzu7p2tncrdmslhxrvz2huz4
Solving scheduling problems from high-level models
2010
4OR
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.
He is a very nice person to work with. He always has plenty of ideas and of motivation. ...
First, most search techniques deal with more or less pure problems, and may not be easily adapted to solve problems with side constraints. ...
Scheduling Systems It is possible to solve scheduling problems in a general purpose CP or MIP solver. However it does not take advantage of the specificity of scheduling. ...
doi:10.1007/s10288-010-0143-7
fatcat:xl2o2skrdzcjroge7ymc4rnxlm
Structured representations in a quantum probability model of similarity
2015
Journal of Mathematical Psychology
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 2018; you can also visit the original URL.
The file type is application/pdf.
This version of the publication may differ from the final published version. ...
The formal properties of the extended QP similarity model are analyzed, some indicative fits are presented, and, finally, a novel prediction is developed. keywords: quantum probability theory, similarity ...
Acknowledgements We would like to thank Jerome Busemeyer and James Hampton for their helpful comments. ...
doi:10.1016/j.jmp.2014.12.001
fatcat:farzkok77jc47mhwgz4yojphwq
Cross-architecture bug search in binary executables
2017
it - Information Technology
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.
AbstractWith the general availability of closed-source software for various CPU architectures, there is a need to identify security-critical vulnerabilities at the binary level. ...
In this paper, we propose a system to derive ...
More specifically, we generate random vectors with elements from the range [−1000, 1000] and use them as input for the formulas. ...
doi:10.1515/itit-2016-0040
fatcat:vjedtlsdhvb2pjfzvv6vgk3qs4
The MiningZinc Framework for Constraint-Based Itemset Mining
2013
2013 IEEE 13th International Conference on Data Mining Workshops
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.
A use case demonstrates the generality of the language, as well as its flexibility towards adding and modifying constraints and data, and the use of different solution methods. ...
Declarative programming and modeling are common in artificial intelligence and in database systems, but not so much in data mining; by building on ideas from these communities, MiningZinc advances the ...
This work was supported by two Postdoc and one project grant "Principles of Patternset Mining" from the Research Foundation-Flanders, and by the EU FET IST project "Inductive Constraint Programming", contract ...
doi:10.1109/icdmw.2013.38
dblp:conf/icdm/GunsDTNR13
fatcat:6lbwpmkfyfdnvo4i6ydm2zkxmm
Cross-Architecture Bug Search in Binary Executables
2015
2015 IEEE Symposium on Security and Privacy
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 define a metric to compare code structures like sub-CFGs and functions, which enables us to search for bug signatures in arbitrary software binaries. • We empirically demonstrate the viability of our ...
More specifically, we generate random vectors with elements from the range [−1000, 1000] and use them as input for the formulas. ...
We do so for two reasons: First, it abstracts from architecture-specific artifacts and facilitates symbolic normalization. ...
doi:10.1109/sp.2015.49
dblp:conf/sp/PewnyGGRH15
fatcat:ghprij537bcf3iifk7shgkthtu
Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems
2008
Engineering applications of artificial intelligence
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.
The workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, or COPLAS, aims at providing a forum for meeting and exchanging ideas and novel works in the field of AI planning ...
We need to manage complex problems where planning, scheduling, and constraint satisfaction must be interrelated, which entail a great potential of application. ...
Acknowledgments This work has been partially supported by a FPI grant from the Spanish government associated to the MICINN project TIN2008-06701-C03-03. ...
doi:10.1016/j.engappai.2008.03.007
fatcat:7dv2wdwsmrednf7t6yltucr23y
Incorporating Figure Captions and Descriptive Text in MeSH Term Indexing
2019
Proceedings of the 18th BioNLP Workshop and Shared Task
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.
Beyond the normal use of the text from the abstract and title for model training, we also consider figure and table captions, as well as paragraphs associated with the figures and tables. ...
A new dataset consisting of these text segments curated from 257,590 full text articles together with the articles' MED-LINE/PubMed MeSH terms is publicly available. ...
Acknowledgements This research is partially funded by The Natural Sciences and Engineering Research Council of Canada through a Discovery Grant to Robert E. Mercer. ...
doi:10.18653/v1/w19-5018
dblp:conf/bionlp/WangM19
fatcat:k2arbfqqq5b3nokdcy75nxiira
Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems
2017
Artificial Intelligence
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.
Abstract Data mining is the study of how to extract information from data and express it as useful knowledge. ...
Recently, new methods adapting results from studies of economic efficiency and multi criteria decision analyses such as Pareto efficiency, or skylines, have been studied. ...
This work is partly supported by the ANR (French Research National Agency) funded projects FiCoLoFo ANR-10-BLA-0214 and Hybride ANR-11-BS002-002. ...
doi:10.1016/j.artint.2015.04.003
fatcat:cjhmceld3vcwjc2zjhuu2xnffe
In a trauma experimental pig model prothrombin complex concentrates and a specific antidote (idarucizumab) are effective to reverse the anticoagulant effects of dabigatran
2014
Critical Care
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Introduction We aimed to audit the prescribing practice on a busy 14-bedd general ICU, and develop standardised practices and tools to improve safety. ...
The Limpet drug cabinet alarm: technology for safer drug stewardship [abstract and poster presentation]. ...
Acknowledgement Funding from Edwards Lifesciences. References Acknowledgement GH and HVM contributed equally to this study. References ...
doi:10.1186/cc13308
pmcid:PMC4068647
fatcat:e4u5tyoernfa3lofhedvxjrpze
DeepCP: Deep Learning Driven Cascade Prediction Based Autonomous Content Placement in Closed Social Network
[article]
2020
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.
Evaluation results corroborate that the proposed DeepCP framework can predict the content popularity with a high accuracy, generate efficient placement decision in a real-time manner, and achieve significant ...
Accordingly, we further propose a novel autonomous content placement mechanism CP-GAN which adopts the generative adversarial network (GAN) for agile placement decision making to reduce the content access ...
Our method can also apply in other cases with more system constraints by only feeding those constraintfeasible samples and decisions generated offline to CP-GAN. ...
arXiv:2003.03971v1
fatcat:xnldollrkfblna3bk5n4lqgwgy
« Previous
Showing results 1 — 15 out of 392 results