Sciweavers

1185 search results - page 173 / 237
» The Equivalence of Sampling and Searching
Sort
View
100
Voted
JAIR
2008
145views more  JAIR 2008»
15 years 15 days ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
IJON
2007
100views more  IJON 2007»
15 years 13 days ago
Minimum range approach to blind partial simultaneous separation of bounded sources: Contrast and discriminacy properties
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
Frédéric Vrins, Dinh-Tuan Pham
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
15 years 6 days ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
118
Voted
NETWORKS
2007
15 years 1 days ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
94
Voted
SAC
2008
ACM
15 years 2 hour ago
Optimizing code through iterative specialization
Code specialization is a way to obtain significant improvement in the performance of an application. It works by exposing values of different parameters in source code. The availa...
Minhaj Ahmad Khan, Henri-Pierre Charles, Denis Bar...