13603 search results - page 229 / 2721 » On the Computational Complexity of Cut-Reduction |
210
Voted
ICIAP
1999
ACM
15 years 11 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
270
click to vote
COLT
1992
Springer
15 years 10 months ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
156
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
180
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
172
click to vote
EDUTAINMENT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We have developed a learning platform to simplify and improve teaching and practice of Computer Graphics for beginners and advanced students. Our goal is to offer a set o...