Sciweavers

8486 search results - page 389 / 1698
» Ordered Enumeration Method
Sort
View
OTM
2005
Springer
16 years 28 days ago
Creating Ontologies for Content Representation-The OntoSeed Suite
Abstract. Due to the inherent difficulties associated with manual ontology building, knowledge acquisition and reuse are often seen as methods that can make this tedious process ea...
Elena Paslaru Bontas, David Schlangen, Thomas Schr...
181
Voted
SEKE
2005
Springer
16 years 27 days ago
Design an Interoperable Mobile Agent System Based on Predicate Transition Net Models
Mobile agents provide an effective and flexible style to develop advanced distributed systems. In order to promote interoperability and ensure the quality of mobile agent systems,...
Junhua Ding, Dianxiang Xu, Yi Deng, Peter J. Clark...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
16 years 26 days ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
202
Voted
ICCBR
2005
Springer
16 years 26 days ago
Case Adaptation by Segment Replanning for Case-Based Planning Systems
An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new proble...
Flavio Tonidandel, Marcio Rillo
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
16 years 25 days ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez