1736 search results - page 221 / 348 » On antimagic directed graphs |
168
click to vote
SEMWEB
2009
Springer
16 years 29 days ago
2009
Springer
Being able to extend an OWL ontology with some form of rules is a feature that many ontology developers consider as very important. Nevertheless, working with rules in practice can...
159
click to vote
TLCA
2009
Springer
16 years 29 days ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
159
click to vote
CDC
2008
IEEE
16 years 28 days ago
2008
IEEE
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
149
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
175
click to vote
ICC
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract— Interference among concurrent transmissions complicates QoS provisioning for multimedia applications in wireless mesh networks. In this paper we propose MARIA (Mesh Adm...