Sciweavers

3267 search results - page 579 / 654
» Generalized quasirandom graphs
Sort
View
AI
1999
Springer
14 years 10 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
IPL
2002
93views more  IPL 2002»
14 years 10 months ago
Storing information with extractors
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
Amnon Ta-Shma
IJFCS
1998
67views more  IJFCS 1998»
14 years 10 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
CN
1999
143views more  CN 1999»
14 years 10 months ago
Embedding Knowledge in Web Documents
The paper argues for the use of general and intuitive knowledge representation languages (and simpler notational variants, e.g. subsets of natural languages) for indexing the cont...
Philippe Martin, Peter W. Eklund
JCB
2002
131views more  JCB 2002»
14 years 10 months ago
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...
Hidde de Jong