Sciweavers

2862 search results - page 112 / 573
» Bicriteria Network Design Problems
Sort
View
DM
2002
82views more  DM 2002»
14 years 10 months ago
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmi...
Frédéric Havet, Janez Zerovnik
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 5 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
CORR
2011
Springer
179views Education» more  CORR 2011»
14 years 1 months ago
Approximating minimum-power edge-multicovers
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Nachshon Cohen, Zeev Nutov
PDC
2004
ACM
15 years 3 months ago
Lost in translation: a critical analysis of actors, artifacts, agendas, and arenas in participatory design
As computer technologies start to permeate the everyday activities of a continuously growing population, social and technical as well as political and legal issues will surface. P...
Rogério De Paula
GROUP
2009
ACM
15 years 4 months ago
Usability heuristics for networked multiplayer games
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...