Sciweavers

26354 search results - page 219 / 5271
» How we refactor, and how we know it
Sort
View
IJCAI
2007
15 years 8 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
CCR
2005
131views more  CCR 2005»
15 years 6 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
CVPR
2005
IEEE
16 years 8 months ago
Feature Kernel Functions: Improving SVMs Using High-Level Knowledge
Kernel functions are often cited as a mechanism to encode prior knowledge of a learning task. But it can be difficult to capture prior knowledge effectively. For example, we know ...
Qiang Sun, Gerald DeJong
ISCC
2008
IEEE
119views Communications» more  ISCC 2008»
16 years 1 months ago
Analyzing a human-based trust model for mobile ad hoc networks
— This paper analyzes a trust model for mobile ad hoc networks. We provide nodes with a mechanism to build a trust relationship with its neighbors. The proposed model considers t...
Pedro B. Velloso, Rafael P. Laufer, Otto Carlos Mu...
GD
2004
Springer
16 years 2 hour ago
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
Craig Gotsman, Yehuda Koren