Sciweavers

1461 search results - page 178 / 293
» Complexity of Graph Covering Problems
Sort
View
WWW
2008
ACM
14 years 10 months ago
Structured objects in owl: representation and reasoning
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
Boris Motik, Bernardo Cuenca Grau, Ulrike Sattler
MOBIHOC
2007
ACM
14 years 9 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 3 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
ICCS
1993
Springer
14 years 2 months ago
Towards Domain-Independent Machine Intelligence
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
Robert Levinson
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 11 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...