Sciweavers

789 search results - page 112 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
JACM
2002
94views more  JACM 2002»
15 years 1 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 2 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
JAIR
2000
152views more  JAIR 2000»
15 years 1 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
GLOBECOM
2008
IEEE
15 years 2 months ago
On the Impact of Caching for High Performance Packet Classifiers
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
Harald Widiger, Andreas Tockhorn, Dirk Timmermann
WSC
2000
15 years 3 months ago
SLX: the X is for extensibility
SLX, Simulation Language with Extensibility, is the newest member in Wolverine Software's family of simulation and animation software. SLX features unique extensibility mecha...
James O. Henriksen