1559 search results - page 299 / 312 » Fundamentals of Generic Programming |
172
Voted
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
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...
141
click to vote
ICDCN
2010
Springer
16 years 20 days ago
2010
Springer
Abstract— Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a ...
172
click to vote
ECBS
2009
IEEE
16 years 20 days ago
2009
IEEE
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...
146
click to vote
CSE
2009
IEEE
16 years 18 days ago
2009
IEEE
—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...
158
click to vote
APPROX
2009
Springer
16 years 13 days ago
2009
Springer
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 ...