Sciweavers

1559 search results - page 299 / 312
» Fundamentals of Generic Programming
Sort
View
84
Voted
MOBIHOC
2002
ACM
15 years 9 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
ICDCN
2010
Springer
15 years 4 months ago
Bandwidth Provisioning in Infrastructure-Based Wireless Networks Employing Directional Antennas
Abstract— Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a ...
Shiva Prasad Kasiviswanathan, Bo Zhao, Sudarshan V...
ECBS
2009
IEEE
164views Hardware» more  ECBS 2009»
15 years 4 months ago
Semantically Enhanced Containers for Concurrent Real-Time Systems
Future space missions, such as Mars Science Laboratory, are built upon computing platforms providing a high degree of autonomy and diverse functionality. The increased sophisticat...
Damian Dechev, Peter Pirkelbauer, Nicolas Rouquett...
CSE
2009
IEEE
15 years 4 months ago
Implementing Social Norms Using Policies
—Multi-agent systems are difficult to develop. One reason for this is that agents are embedded in a society where all agents must agree to obey certain social norms in order for...
Robert Kremer
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 4 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop