Sciweavers

10890 search results - page 1874 / 2178
» Automatic Complexity Analysis
Sort
View
HYBRID
2000
Springer
15 years 10 months ago
A Dynamic Bayesian Network Approach to Tracking Using Learned Switching Dynamic Models
Abstract. Switching linear dynamic systems (SLDS) attempt to describe a complex nonlinear dynamic system with a succession of linear models indexed by a switching variable. Unfortu...
Vladimir Pavlovic, James M. Rehg, Tat-Jen Cham
ICSE
2000
IEEE-ACM
15 years 10 months ago
Requirements engineering in the year 00: a research perspective
Requirements engineering (RE) is concerned with the identification of the goals to be achieved by the envisioned system, the operationalization of such goals into services and con...
Axel van Lamsweerde
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 10 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
FOCS
1995
IEEE
15 years 10 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
ICCBR
1995
Springer
15 years 10 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
« Prev « First page 1874 / 2178 Last » Next »