Sciweavers

353 search results - page 11 / 71
» Dynamic search in peer-to-peer networks
Sort
View
CP
2005
Springer
14 years 1 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
13 years 12 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
COMCOM
2008
83views more  COMCOM 2008»
13 years 7 months ago
Hierarchical multidimensional search in peer-to-peer networks
We propose a P2P search solution, called EZSearch, that enables efficient multidimensional search for remotely located contents that best match the search criteria. EZSearch is a h...
Duc A. Tran, T. Nguyen
CPAIOR
2005
Springer
14 years 1 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
ATAL
2009
Springer
14 years 2 months ago
Using relational concept knowledge to improve search in referral networks
The notion of referral networks, as presented in the work of Singh and Yolum, and their application to knowledge management, lacks two fundamental aspects; the relation of concept...
Tony White, Shawn McQuaker, Amirali Salehi-Abari