3690 search results - page 470 / 738 » Computation with classical sequents |
175
click to vote
EPIA
2005
Springer
16 years 6 days ago
2005
Springer
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
207
click to vote
PVM
2005
Springer
16 years 5 days ago
2005
Springer
Parallel execution of simulation runs has become indispensable in different research areas recently. One of the most promising and powerful models in science are cellular automata ...
169
click to vote
SOFSEM
2005
Springer
16 years 5 days ago
2005
Springer
Recently, a range of applications of views increases. Views are not anymore tightly related to classical databases – there are proposals to use them as means of data transformati...
173
click to vote
STACS
2005
Springer
16 years 5 days ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
195
click to vote
WABI
2005
Springer
16 years 5 days ago
2005
Springer
Abstract Baharak Rastegari and Anne Condon Department of Computer Science, University of British Columbia Abstract. Accurate prediction of pseudoknotted RNA secondary structure is ...