Sciweavers

2905 search results - page 191 / 581
» Formal Memetic Algorithms
Sort
View
162
Voted
ICSE
1994
IEEE-ACM
15 years 10 months ago
Storing and Retrieving Software Components: A Refinement Based System
Software libraries are repositories which contain software components; as such, they represent a precious resource for the software engineer. As software libraries grow in size, it...
Ali Mili, Rym Mili, Roland Mittermeir
167
Voted
ATAL
2006
Springer
15 years 10 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi
FOCS
2000
IEEE
15 years 10 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
154
Voted
AIPS
2003
15 years 8 months ago
Synthesis of Hierarchical Finite-State Controllers for POMDPs
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
Eric A. Hansen, Rong Zhou
179
Voted
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 6 months ago
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J...