Sciweavers

1487 search results - page 39 / 298
» The Computational Complexity of Link Building
Sort
View
SIGGRAPH
2003
ACM
14 years 1 months ago
Animating art history: building a bridge between disciplines
The study of art history is an exciting and rewarding one, but one in which the student frequently encounters complex and difficult to understand concepts. Traditional methodologi...
LiQin Tan, Roberta K. Tarbell, Robert Wuilfe
PERCOM
2006
ACM
14 years 8 months ago
QoS Routing in OLSR with Several Classes of Service
The Optimized Link State Routing (OLSR) protocol is a proactive link-state protocol bafor ad-hoc networks. It uses an optimization called Multi-Point Relays (MPRs) to provide an e...
Jeremie Leguay, Timur Friedman
ICCNMC
2005
Springer
14 years 2 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
PODC
2005
ACM
14 years 2 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
ISORC
2008
IEEE
14 years 2 months ago
The Complexity Challenge in Embedded System Design
The specific constraints that must be satisfied by embedded systems, such as timeliness, energy efficiency of battery-operated devices, dependable operation in safety-relevant sce...
Hermann Kopetz