Sciweavers

2006 search results - page 93 / 402
» Heuristic Security-Testing Methods
Sort
View
99
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 22 days ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
15 years 19 days ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
79
Voted
CORR
2002
Springer
86views Education» more  CORR 2002»
15 years 14 days ago
The Management of Context-Sensitive Features: A Review of Strategies
In this paper, we review five heuristic strategies for handling context-sensitive features in supervised machine learning from examples. We discuss two methods for recovering lost...
Peter D. Turney
149
Voted
ML
2002
ACM
246views Machine Learning» more  ML 2002»
15 years 9 days ago
Bayesian Clustering by Dynamics
This paper introduces a Bayesian method for clustering dynamic processes. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to disc...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
104
Voted
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
15 years 6 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler