Sciweavers

1760 search results - page 65 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ICMLA
2007
13 years 10 months ago
Phase transition and heuristic search in relational learning
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
Érick Alphonse, Aomar Osmani
JCM
2006
169views more  JCM 2006»
13 years 9 months ago
Trends in Middleware for Mobile Ad Hoc Networks
The use of middleware has extended from simply facilitating applications' communication to a broad set of services supporting a huge spectrum of networked and distributed comp...
Salem Hadim, Jameela Al-Jaroodi, Nader Mohamed
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
14 years 1 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
MICCAI
2002
Springer
14 years 10 months ago
New Approaches to Estimation of White Matter Connectivity in Diffusion Tensor MRI: Elliptic PDEs and Geodesics in a Tensor-Warpe
Abstract. We investigate new approaches to quantifying the white matter connectivity in the brain using Diffusion Tensor Magnetic Resonance Imaging data. Our first approach finds a...
Lauren O'Donnell, Steven Haker, Carl-Fredrik Westi...
COCOON
2008
Springer
13 years 10 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi