Sciweavers

1951 search results - page 285 / 391
» An algorithm for improving graph partitions
Sort
View
ATAL
2004
Springer
15 years 8 months ago
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
Viet Dung Dang, Nicholas R. Jennings
BMCBI
2004
181views more  BMCBI 2004»
15 years 4 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
TSP
2010
14 years 11 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 4 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
INFORMS
1998
142views more  INFORMS 1998»
15 years 4 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol