840 search results - page 27 / 168 » The Complexity of the Extended GCD Problem |
LATA
2010
Springer
14 years 2 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
UAI
2004
13 years 9 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
IS
2008
13 years 7 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...