Sciweavers

4908 search results - page 648 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ATAL
2001
Springer
15 years 11 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
CP
2001
Springer
15 years 11 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
EUROPAR
2001
Springer
15 years 11 months ago
Multiprocessor Clustering for Embedded Systems
Abstract. In this paper, we address two key trends in the synthesis of implementations for embedded multiprocessors — (1) the increasing importance of managing interprocessor com...
Vida Kianzad, Shuvra S. Bhattacharyya
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
DCC
2000
IEEE
15 years 11 months ago
Multiple Description Lattice Vector Quantization: Variations and Extensions
Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto, Vai...
Jonathan A. Kelner, Vivek K. Goyal, Jelena Kovacev...