Sciweavers

801 search results - page 50 / 161
» A Knowledge-theoretic Approach to Distributed Problem Solvin...
Sort
View
AIMSA
2008
Springer
13 years 9 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
14 years 8 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
LCN
1997
IEEE
13 years 12 months ago
The Optimal Virtual Path Design of ATM Networks
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...
Zhigang Qin, Tetiana Lo, Felix F. Wu
COR
2006
95views more  COR 2006»
13 years 7 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
DSE
1998
80views more  DSE 1998»
13 years 7 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava