789 search results - page 37 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
59
Voted
IPPS
1994
IEEE
15 years 1 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
ICPP
2007
IEEE
15 years 4 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
AHS
2006
IEEE
15 years 3 months ago
2006
IEEE
Traditional approaches to evolvable hardware (EHW), in which the field programmable gate array (FPGA) configuration is directly encoded, have not scaled well with increasing cir...
147
Voted
POPL
2008
ACM
15 years 10 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...