Sciweavers

232 search results - page 30 / 47
» Set approximations in fuzzy formal concept analysis
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
90
Voted
TOOLS
2008
IEEE
15 years 3 months ago
An AsmL Semantics for Dynamic Structures and Run Time Schedulability in UML-RT
Abstract. Many real-time systems use runtime structural reconfiguration mechanisms based on dynamic creation and destruction of components. To support such features, UML-RT provid...
Stefan Leue, Alin Stefanescu, Wei Wei
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
14 years 10 months ago
MLS security policy evolution with genetic programming
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
Yow Tzu Lim, Pau-Chen Cheng, Pankaj Rohatgi, John ...
ASP
2005
Springer
15 years 3 months ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir