Sciweavers

903 search results - page 115 / 181
» Non-well-founded trees in categories
Sort
View
WICON
2008
15 years 3 months ago
Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami
TREC
1994
15 years 3 months ago
Indexing Structures Derived from Syntax in TREC-3: System Description
: This paper describes an approach to information retrieval based on a syntactic analysis of the document texts and user queries, and from that analysis, the construction of tree s...
Alan F. Smeaton, Ruairi O'Donnell, Fergus Kelledy
IJCAI
1989
15 years 3 months ago
Noise-Tolerant Instance-Based Learning Algorithms
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
David W. Aha, Dennis F. Kibler
COLING
1992
15 years 3 months ago
The Proper Treatment Of Word Order In HPSG
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
Karel Oliva
ATAL
2010
Springer
15 years 3 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat