Sciweavers

4797 search results - page 129 / 960
» The complexity of partition tasks
Sort
View
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 10 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
HOLOMAS
2003
Springer
14 years 3 months ago
Complex Data Integration Based on a Multi-agent System
The expansion of the WWW and the growth of data sources lead to the proliferation of heterogeneous data (texts, images, videos, sounds and relational views). We call these data ”...
Omar Boussaid, Fadila Bentayeb, Amandine Duffoux, ...
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
14 years 4 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
NIPS
2007
13 years 11 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
JACM
2008
90views more  JACM 2008»
13 years 10 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum