Sciweavers

19700 search results - page 3867 / 3940
» DNA-Based Computation Times
Sort
View
ICML
1999
IEEE
14 years 1 months ago
Learning Hierarchical Performance Knowledge by Observation
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
Michael van Lent, John E. Laird
SIGMOD
1999
ACM
99views Database» more  SIGMOD 1999»
14 years 1 months ago
Belief Reasoning in MLS Deductive Databases
It is envisaged that the application of the multilevel security (MLS) scheme will enhance exibility and e ectiveness of authorization policies in shared enterprise databases and w...
Hasan M. Jamil
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
14 years 1 months ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 1 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
CIKM
1999
Springer
14 years 1 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
« Prev « First page 3867 / 3940 Last » Next »