837 search results - page 43 / 168 » Hard combinators |
ICSE
2001
IEEE-ACM
15 years 4 months ago
2001
IEEE-ACM
In requirements elicitation, different stakeholders often hold different views of how a proposed system should behave, resulting in inconsistencies between their descriptions. Con...
PPDP
1999
Springer
15 years 4 months ago
1999
Springer
For a compiler writer, generating good machine code for a variety of platforms is hard work. One might try to reuse a retargetable code generator, but code generators are complex a...
CATS
2008
15 years 1 months ago
2008
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
INFFUS
2006
14 years 11 months ago
2006
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
121
click to vote
KES
2008
Springer
14 years 11 months ago
2008
Springer
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...