Sciweavers

759 search results - page 67 / 152
» What Can Be Implemented Anonymously
Sort
View
UPP
2004
Springer
14 years 3 months ago
Bio-inspired Computing Paradigms (Natural Computing)
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
Gheorghe Paun
RECOMB
2006
Springer
14 years 10 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
ECRTS
2005
IEEE
14 years 3 months ago
Non-blocking Deterministic Replacement of Functionality, Timing, and Data-Flow for Hard Real-Time Systems at Runtime
Embedded systems are usually an integral component of a larger system and are used to control and/or directly monitor this system by using special hardware devices. The complexity...
Sebastian Fischmeister, Klemens Winkler
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 3 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ď¬...
Filippo Geraci, Roberto Grossi
CSCW
2000
ACM
14 years 2 months ago
Explaining collaborative filtering recommendations
Automated collaborative filtering (ACF) systems predict a person’s affinity for items or information by connecting that person’s recorded interests with the recorded interests...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...