Sciweavers

1120 search results - page 89 / 224
» time 1999
Sort
View
RECOMB
2000
Springer
15 years 2 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
CN
1999
74views more  CN 1999»
14 years 10 months ago
FIPA-compliant agents for real-time control of Intelligent Network traffic
Autonomy, adaptability, scalability, and flexible communications are all attributes of agents and multi-agent systems which suggest that they may offer timely solutions for dealin...
Brendan Jennings, Rob Brennan, Rune Gustavsson, Ro...
CN
1999
119views more  CN 1999»
14 years 10 months ago
Web Caching with Consistent Hashing
A key performance measure for the World Wide Web is the speed with which content is served to users. As traffic on the Web increases, users are faced with increasing delays and fa...
David R. Karger, Alex Sherman, Andy Berkheimer, Bi...
DM
1999
145views more  DM 1999»
14 years 10 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
IFL
1999
Springer
108views Formal Methods» more  IFL 1999»
15 years 3 months ago
Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
John H. G. van Groningen