Sciweavers

4372 search results - page 377 / 875
» Algorithmic Theories of Everything
Sort
View
ALDT
2009
Springer
140views Algorithms» more  ALDT 2009»
16 years 1 months ago
Directional Decomposition of Multiattribute Utility Functions
Abstract. Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Ma...
Ronen I. Brafman, Yagil Engel
BPM
2009
Springer
168views Business» more  BPM 2009»
16 years 1 months ago
Divide-and-Conquer Strategies for Process Mining
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
GECCO
2009
Springer
104views Optimization» more  GECCO 2009»
16 years 1 months ago
Sustaining diversity using behavioral information distance
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
Faustino J. Gomez
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
SOCO
2009
Springer
16 years 1 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant