Sciweavers

201 search results - page 21 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
NIPS
2001
13 years 10 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
CG
2007
Springer
13 years 8 months ago
Density estimation for dynamic volumes
We propose a new approach to capture the volumetric density of dynamic scattering media instantaneously with a single image. The volume is probed with a set of laser lines and the...
Christian Fuchs, Tongbo Chen, Michael Goesele, Hol...
FM
2005
Springer
112views Formal Methods» more  FM 2005»
14 years 2 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
14 years 2 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
NIPS
2008
13 years 10 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas