364 search results - page 26 / 73 » Generalized normal forms and polynomial system solving |
93
Voted
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
ESOP
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
193
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
67
Voted
INTERSPEECH
2010
14 years 4 months ago
2010
To achieve natural high quality synthesised speech in HMMbased speech synthesis, the effective modelling of complex acoustic and linguistic contexts is critical. Traditional appro...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...