Sciweavers

1047 search results - page 195 / 210
» Learning the required number of agents for complex tasks
Sort
View
UIST
2005
ACM
14 years 1 months ago
A1: end-user programming for web-based system administration
System administrators work with many different tools to manage and fix complex hardware and software infrastructure in a rapidly paced work environment. Through extensive field st...
Eser Kandogan, Eben M. Haber, Rob Barrett, Allen C...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
WSC
2000
13 years 9 months ago
Model abstraction for discrete event systems using neural networks and sensitivity information
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
Christos G. Panayiotou, Christos G. Cassandras, We...
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 3 days ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 9 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan