Sciweavers

5378 search results - page 994 / 1076
» Base Logics in Argumentation
Sort
View
MIS
2008
Springer
130views Multimedia» more  MIS 2008»
13 years 8 months ago
Adaptive and fuzzy approaches for nodes affinity management in wireless ad-hoc networks
In most of the ad-hoc routing protocols, a static link lifetime (LL) is used for a newly discovered neighbors. Though this works well for networks with fixed infrastructures, it is...
Essam Natsheh, Tat Chee Wan
ENTCS
2007
114views more  ENTCS 2007»
13 years 8 months ago
A Graph Abstract Machine Describing Event Structure Composition
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...
Claudia Faggian, Mauro Piccolo
ENTCS
2007
103views more  ENTCS 2007»
13 years 8 months ago
Policy-based Coordination in PAGODA: A Case Study
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environme...
Carolyn L. Talcott
ML
2008
ACM
13 years 8 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
MST
2006
129views more  MST 2006»
13 years 8 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding