Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1255570#aggregation> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- aggregation classification "C1".
- aggregation creator B117919.
- aggregation creator B117920.
- aggregation creator B117921.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2011".
- aggregation format "application/pdf".
- aggregation hasFormat 1255570.bibtex.
- aggregation hasFormat 1255570.csv.
- aggregation hasFormat 1255570.dc.
- aggregation hasFormat 1255570.didl.
- aggregation hasFormat 1255570.doc.
- aggregation hasFormat 1255570.json.
- aggregation hasFormat 1255570.mets.
- aggregation hasFormat 1255570.mods.
- aggregation hasFormat 1255570.rdf.
- aggregation hasFormat 1255570.ris.
- aggregation hasFormat 1255570.txt.
- aggregation hasFormat 1255570.xls.
- aggregation hasFormat 1255570.yaml.
- aggregation isPartOf urn:isbn:9783642237850.
- aggregation isPartOf urn:isbn:9783642237867.
- aggregation isPartOf urn:issn:0302-9743.
- aggregation language "eng".
- aggregation publisher "Springer".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Science General".
- aggregation title "Search combinators".
- aggregation abstract "The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a low-level programming language and modeling search becomes unwieldy. As a result, major improvements in perfor- mance may remain unexplored. This paper introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple search language (high- level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). Search combinators allow one to define application-tailored strategies from a small set of primitives, resulting in a rich search language for the user and a low implementation cost for the de- veloper of a constraint solver. The paper discusses two modular implementation approaches and shows, by empirical evaluation, that search combinators can be implemented without overhead compared to a native, direct implementation in a constraint solver.".
- aggregation authorList BK303502.
- aggregation endPage "788".
- aggregation startPage "774".
- aggregation volume "6876".
- aggregation aggregates 1266870.
- aggregation isDescribedBy 1255570.
- aggregation similarTo 978-3-642-23786-7_58.
- aggregation similarTo LU-1255570.