Sciweavers

655 search results - page 60 / 131
» On Flat Programs with Lists
Sort
View
GCB
1997
Springer
77views Biometrics» more  GCB 1997»
13 years 12 months ago
Statistics of large scale sequence searching
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
Rainer Spang, Martin Vingron
AAAI
2007
13 years 10 months ago
Data Structures for Generalised Arc Consistency for Extensional Constraints
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
AIR
2006
76views more  AIR 2006»
13 years 7 months ago
Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
Ronan Cummins, Colm O'Riordan
ASPLOS
2006
ACM
14 years 1 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
CPAIOR
2009
Springer
14 years 2 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin