Sciweavers

1451 search results - page 135 / 291
» Order independence and rationalizability
Sort
View
AI
2008
Springer
15 years 6 months ago
Graphically structured value-function compilation
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly s...
Ronen I. Brafman, Carmel Domshlak
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 6 months ago
Document stream clustering: experimenting an incremental algorithm and AR-based tools for highlighting dynamic trends
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
Alain Lelu, Martine Cadot, Pascal Cuxac
CORR
2006
Springer
121views Education» more  CORR 2006»
15 years 6 months ago
Heterogeneous Strong Computation Migration
The continuous increasing in performance requirements, for both scientic computation and industry, motivates the need of a powerful computing infrastructure. The Grid appeared as ...
Anolan Milanés, Noemi de La Rocque Rodrigue...
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...