Filters








81,281 Hits in 6.9 sec

Verifying hardware in its software context

Kurshan, Levin, Minea, Peled, Yenigun
1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD) ICCAD-97  
Thus, independent of the interface verification problem, this gives a general method for combining partial order reduction with symbolic model-checking.  ...  Our methodology incorporates partial order reduction on the software side, and localization reduction, to deal with the computational complexity of the verification.  ...  In particular, this gives a method for combining partial order reduction with symbolic search.  ... 
doi:10.1109/iccad.1997.643621 fatcat:uqoz5k7vlfflzpepn73fbwuaku

Present and Future of Practical SAT Solving [chapter]

Oliver Kullmann
2008 Lecture Notes in Computer Science  
A general "modern" scheme for DPLL algorithms is presented, which allows natural representations for "modern" solvers of these two types.  ...  We review current SAT solving, concentrating on the two paradigms of conflict-driven and look-ahead solvers, and with a view towards the unification of these two paradigms.  ...  The three main paradigms for SAT solving, "conflict-driven", "look-ahead" and "local search" should be combined (in a new, intelligent way). 2.  ... 
doi:10.1007/978-3-540-92800-3_11 fatcat:lihr6k7mfbd5bbcn6456urdcwa

Hybrid CSP Solving [chapter]

Eric Monfroy, Frédéric Saubion, Tony Lambert
2005 Lecture Notes in Computer Science  
This framework is used for the hybridization of local search and constraint propagation, and for the integration of genetic algorithms and constraint propagation.  ...  We develop a theoretical model based on chaotic iterations in which hybrid resolution can be achieved as the computation of a fixpoint of elementary functions.  ...  We would like to thank the program committee who gave us the opportunity of writing this paper and more especcially Christophe Ringeissen for his interesting remarks and useful comments.  ... 
doi:10.1007/11559306_8 fatcat:j7irtm2i2vebdnp74ens757jwu

A comparative analysis of partial order planning and task reduction planning

Subbarao Kambhampati
1995 ACM SIGART Bulletin  
In this paper I will describe a generalized algorithm template for partial order planning based on refinement search, and extend it to cover HTN planning.  ...  Although task reduction (HTN) planning historically preceded partial order (PO) planning, and is believed to be more general than the latter, very little comparative analysis of the two planning formalisms  ...  Section 2, reviews the refinement search based semantics for partial order planning, and describes Refine-plan-PO, a generalized algorithm for partial order planning.  ... 
doi:10.1145/202187.202192 fatcat:i3k664l4oje3lmrnnjgcpc4rta

On Hybridization of Local Search and Constraint Propagation [chapter]

Eric Monfroy, Frédéric Saubion, Tony Lambert
2004 Lecture Notes in Computer Science  
In this paper we propose a theoretical model based on K.R. Apt's chaotic iterations for hybridization of local search and constraint propagation.  ...  Hybrid resolution can be achieved as the computation of a fixpoint of some specific reduction functions. Our framework opens up new and finer possibilities for hybridization/combination strategies.  ...  The authors are grateful to Willem Jan van Hoeve for the interesting remarks he made on a preliminary version of this paper and to the anonymous referees for their useful comments.  ... 
doi:10.1007/978-3-540-27775-0_21 fatcat:vs52zp4qfzag7heczi62cqhucm

Off the Trail: Re-examining the CDCL Algorithm [chapter]

Alexandra Goultiaeva, Fahiem Bacchus
2012 Lecture Notes in Computer Science  
In the new formulation of CDCL as local search, the trail no longer plays a central role in the algorithm.  ...  We show that the standard formulation of CDCL as a backtracking search algorithm and our new formulation of CDCL as a local search algorithm are equivalent, up to tie breaking.  ...  5 v ← pickVar(I) 6 flip(v) 7 end 8 end 9 return true Local Search Algorithm 2 presents a generic local search algorithm.  ... 
doi:10.1007/978-3-642-31612-8_4 fatcat:wtkdm7rl3zczrb4s7dmh7imznq

Exploiting Fine-Grained Parallelism in the Phylogenetic Likelihood Function with MPI, Pthreads, and OpenMP: A Performance Study [chapter]

Alexandros Stamatakis, Michael Ott
2008 Lecture Notes in Computer Science  
We address these issues via a thorough performance study by example of RAxML, which is a widely used Bioinformatics application for large-scale phylogenetic inference under the Maximum Likelihood criterion  ...  We provide an overview over the respective parallelization strategies with MPI, Pthreads, and OpenMP and assess performance for these approaches on a large variety of parallel architectures.  ...  We would like to thank Dimitris Nikolopoulos for useful discussions on previous comparative performance studies for different programming paradigms.  ... 
doi:10.1007/978-3-540-88436-1_36 fatcat:prvt4uy5pjbejb6tkp2zk44xp4

The Dualistic Model of European Agriculture: a Theoretical Framework for the Endogenous Development

Antonio SORTINO, Margherita CHANG TING FA
2009 Annals of Dunarea de Jos University. Fascicle I : Economics and Applied Informatics  
In this article, wewill develop a theoretical framework which encompasses the different patternsof endogenous development in both agriculture typologies.  ...  The European model of agriculture refers to a multifunctional andvirtuous model of agriculture that is progressively substituting the productivistmodel of agriculture, that, in the recent past, has been  ...  Sonia Arena (soniapatrizia@hotmail.com) for having kindly translated this article from Italian into English. We would like to acknowledge the following contributions: A.  ... 
doaj:306e17eceb0e463aa4f38788d9848529 fatcat:r7t6vjldkndwlngrh7lp5tythm

Improving Non-Progress Cycle Checks [chapter]

David Faragó, Peter H. Schmitt
2009 Lecture Notes in Computer Science  
The new algorithm is better combinable with partial order reduction than SPIN's method.  ...  This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks.  ...  strength of partial order reduction.  ... 
doi:10.1007/978-3-642-02652-2_8 fatcat:nbnzpgdrtjc6dftcjlar4rtre4

Automating the design of algorithms [chapter]

Douglas R. Smith
1993 Lecture Notes in Computer Science  
The first is devoted to the automation of program construction.  ...  We trace the use of KIDS in deriving a scheduling algorithm.  ...  Or-reduction (global search) involves the reduction of a problem to a structure of subproblems at least one of whose solutions are required in order to obtain a solution to the initial problem.  ... 
doi:10.1007/3-540-57499-9_25 fatcat:ezbpogrnjvhmzkrwqwow2y7fee

Genetic map construction with constraints

D A Clark, C J Rawlings, S Doursenot
1994 Proceedings. International Conference on Intelligent Systems for Molecular Biology  
The features of constraint logic programming are used to enable the integration of pre-existing mapping information (partial probe orders from cytogenetic maps and local physical maps) into the global  ...  A pilot program, CME, is described for generating a physical genetic map from hybridization fingerprinting data. CME is implemented in the parallel constraint logic programming language ElipSys.  ...  Thanks to Richard Mott (ICRF Genome Analysis Laboratory) for making data and display programs available and ECRC colleagues for ElipSys support.  ... 
pmid:7584421 fatcat:a6iwucxu6fbptamo4icf3weeiu

A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization [article]

Peng Yang, Ke Tang, Xin Yao
2018 arXiv   pre-print
As a powerful optimization tool for many real-world applications, evolutionary algorithms (EAs) fail to solve the emerging large-scale problems both effectively and efficiently.  ...  In this paper, we propose a novel Divide-and-Conquer (DC) based EA that can not only produce high-quality solution by solving sub-problems separately, but also highly utilizes the power of parallel computing  ...  In the t-th iteration (t < T ), a new populationX t will be first generated based on the last population X t via some specific randomized search operators, and then the candidate solutionsx t in the new  ... 
arXiv:1812.02500v1 fatcat:zxmofn7jazhmvbyc2plm2ppp7y

A history of the Oz multiparadigm language

Peter Van Roy, Seif Haridi, Christian Schulte, Gert Smolka
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
The parent space first creates a new local space with NewSpace.  ...  all reduction orders, up to variable renaming.  ...  The relational paradigms extend the functional paradigms We specify a new abstraction, ForCollect, that can do this: This loops over all elements in L and executes statement S with loop index I and collect  ... 
doi:10.1145/3386333 fatcat:sznttm7q3nhedfm5hcue7x76di

Content-Based Copy Retrieval Using Distortion-Based Probabilistic Similarity Search

A. Joly, O. Buisson, C. Frelicot
2007 IEEE transactions on multimedia  
We first propose a new approximate similarity search technique in which the probabilistic selection of the feature space regions is not based on the distribution in the database but on the distribution  ...  In this paper, we present a copy-retrieval scheme based on local features that can deal with very large databases both in terms of quality and speed.  ...  The search of each local feature provides a partial result consisting in a set of similar local features (called neighbors).  ... 
doi:10.1109/tmm.2006.886278 fatcat:5jyy3zdvana3zew55eip7lxpce

Verification of Concurrent Programs Using Trace Abstraction Refinement [chapter]

Franck Cassez, Frowin Ziegler
2015 Lecture Notes in Computer Science  
In this paper, we show that we can combine partial order reduction techniques with trace abstraction refinement.  ...  On the one hand, the most successful approaches to address the control state explosion problem are based on assume-guarantee reasoning or modelchecking coupled with partial order reduction.  ...  Conclusion and Ongoing Work We have proposed a new method for verifying concurrent programs based on trace abstraction refinement and partial order reduction techniques.  ... 
doi:10.1007/978-3-662-48899-7_17 fatcat:zylnorrtsjdjnpawvrpwjqdgby
« Previous Showing results 1 — 15 out of 81,281 results