Sciweavers

1460 search results - page 235 / 292
» Meeting people where they are
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 6 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
WOWMOM
2005
ACM
82views Multimedia» more  WOWMOM 2005»
15 years 5 months ago
Power Control is not Required for Wireless Networks in the Linear Regime
— We consider the design of optimal strategies for joint power adaptation, rate adaptation and scheduling in a multi-hop wireless network. Most existing strategies control either...
Bozidar Radunovic, Jean-Yves Le Boudec
UML
2005
Springer
15 years 5 months ago
Enhancement of Development Technologies for Agent-Based Software Engineering
Abstract. Current trends in software development show a move towards supporting autonomous components (agents). The accurate timing of interactions between such components is growi...
Andre Karpistsenko
EWSA
2004
Springer
15 years 5 months ago
An Architecture Description Language for Mobile Distributed Systems
Mobile software applications have to meet new requirements directly arising from mobility issues. To address these requirements at an early stage in development, an architecture d...
Volker Gruhn, Clemens Schäfer