Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Run-time_algorithm_specialisation> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Run-time_algorithm_specialisation abstract "In computer science, run-time algorithm specialization is a methodology for creating efficient algorithms for costly computation tasks of certain kinds. The methodology originates in the field of automated theorem proving and, more specifically, in the Vampire theorem prover project.The idea is inspired by the use of partial evaluation in optimising program translation. Many core operations in theorem provers exhibit the following pattern.Suppose that we need to execute some algorithm in a situation where a value of is fixed for potentially many different values of . In order to do this efficiently, we can try to find a specialization of for every fixed , i.e., such an algorithm , that executing is equivalent to executing .The specialized algorithm may be more efficient than the generic one, since it can exploit some particular properties of the fixed value . Typically, can avoid some operations that would have to perform, if they are known to be redundant for this particular parameter . In particular, we can often identify some tests that are true or false for , unroll loops and recursion, etc.".
- Run-time_algorithm_specialisation wikiPageExternalLink summary?doi=10.1.1.4.2624.
- Run-time_algorithm_specialisation wikiPageExternalLink summary?doi=10.1.1.57.8542.
- Run-time_algorithm_specialisation wikiPageExternalLink r127l5t26vu1m360.
- Run-time_algorithm_specialisation wikiPageID "2935699".
- Run-time_algorithm_specialisation wikiPageRevisionID "594852798".
- Run-time_algorithm_specialisation hasPhotoCollection Run-time_algorithm_specialisation.
- Run-time_algorithm_specialisation subject Category:Algorithms.
- Run-time_algorithm_specialisation subject Category:Software_optimization.
- Run-time_algorithm_specialisation type Abstraction100002137.
- Run-time_algorithm_specialisation type Act100030358.
- Run-time_algorithm_specialisation type Activity100407535.
- Run-time_algorithm_specialisation type Algorithm105847438.
- Run-time_algorithm_specialisation type Algorithms.
- Run-time_algorithm_specialisation type Event100029378.
- Run-time_algorithm_specialisation type Procedure101023820.
- Run-time_algorithm_specialisation type PsychologicalFeature100023100.
- Run-time_algorithm_specialisation type Rule105846932.
- Run-time_algorithm_specialisation type YagoPermanentlyLocatedEntity.
- Run-time_algorithm_specialisation comment "In computer science, run-time algorithm specialization is a methodology for creating efficient algorithms for costly computation tasks of certain kinds. The methodology originates in the field of automated theorem proving and, more specifically, in the Vampire theorem prover project.The idea is inspired by the use of partial evaluation in optimising program translation.".
- Run-time_algorithm_specialisation label "Run-time algorithm specialisation".
- Run-time_algorithm_specialisation sameAs m.08dr_g.
- Run-time_algorithm_specialisation sameAs Q7379464.
- Run-time_algorithm_specialisation sameAs Q7379464.
- Run-time_algorithm_specialisation sameAs Run-time_algorithm_specialisation.
- Run-time_algorithm_specialisation wasDerivedFrom Run-time_algorithm_specialisation?oldid=594852798.
- Run-time_algorithm_specialisation isPrimaryTopicOf Run-time_algorithm_specialisation.