Sciweavers

314 search results - page 51 / 63
» connection 1998
Sort
View
ML
1998
ACM
115views Machine Learning» more  ML 1998»
13 years 8 months ago
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL
This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speci cally, the paper describes a sequence of experiments in...
Paul W. Finn, Stephen Muggleton, David Page, Ashwi...
MOC
1998
92views more  MOC 1998»
13 years 8 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
PC
1998
140views Management» more  PC 1998»
13 years 8 months ago
A Framework for Structured Distributed Object Computing
This paper presents a four-faceted framework for distributed applications that use worldwide networks connecting large numbers of people, software tools, monitoring instruments, a...
K. Mani Chandy, Joseph Kiniry, Adam Rifkin, Daniel...
PE
1998
Springer
158views Optimization» more  PE 1998»
13 years 8 months ago
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
Charles Knessl, Charles Tier
SIAMDM
1998
95views more  SIAMDM 1998»
13 years 8 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd