Sciweavers

5831 search results - page 8 / 1167
» Distributed Dynamic Backtracking
Sort
View
CIMCA
2006
IEEE
14 years 2 months ago
Model-driven Walks for Resource Discovery in Peer-to-Peer Networks
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
Mohamed Bakhouya, Jaafar Gaber
ECAI
1994
Springer
14 years 20 days ago
Operationalizing Conceptual Models Based on a Model of Dependencies
Abstract. In this paper we describe a framework for defining and operationalizing conceptual models of distributed knowledge-based systems which extends published approaches by the...
Frank Maurer, Jürgen Paulokat
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
14 years 2 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
JAIR
2000
94views more  JAIR 2000»
13 years 8 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
CP
2003
Springer
14 years 1 months ago
Distributed Forward Checking
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
Ismel Brito, Pedro Meseguer