Sciweavers

2905 search results - page 168 / 581
» Formal Memetic Algorithms
Sort
View
ICML
2007
IEEE
14 years 11 months ago
Intractability and clustering with constraints
Clustering with constraints is a developing area of machine learning. Various papers have used constraints to enforce particular clusterings, seed clustering algorithms and even l...
Ian Davidson, S. S. Ravi
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 10 months ago
Detecting time series motifs under uniform scaling
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
Dragomir Yankov, Eamonn J. Keogh, Jose Medina, Bil...
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 5 months ago
Linear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
Mircea Marin, Temur Kutsia
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
14 years 3 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
CAV
2004
Springer
159views Hardware» more  CAV 2004»
14 years 3 months ago
Static Program Analysis via 3-Valued Logic
This paper reviews the principles behind the paradigm of “abstract interpretation via § -valued logic,” discusses recent work to extend the approach, and summarizes ongoing re...
Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm