Sciweavers

10988 search results - page 249 / 2198
» Algorithmic Folding Complexity
Sort
View
AAAI
1997
15 years 5 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
AAAI
1993
15 years 5 months ago
Hybrid Case-Based Reasoning for the Diagnosis of Complex Devices
A novel approach to integrating case-based reasoning with model-based diagnosis is presented. The main idea is to use the model of the device and the results of diagnostic tests t...
Michel P. Féret, Janice I. Glasgow
DAM
2008
131views more  DAM 2008»
15 years 4 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
IJHPCA
2008
104views more  IJHPCA 2008»
15 years 4 months ago
Low-Complexity Principal Component Analysis for Hyperspectral Image Compression
Principal component analysis (PCA) is an effective tool for spectral decorrelation of hyperspectral imagery, and PCA-based spectral transforms have been employed successfully in co...
Qian Du, James E. Fowler