Sciweavers

6506 search results - page 1109 / 1302
» Algorithmic models for sensor networks
Sort
View
CACM
2006
160views more  CACM 2006»
14 years 10 months ago
Service systems, service scientists, SSME, and innovation
: Computer scientists work with formal models of algorithms and computation, and someday service scientists may work with formal models of service systems, which we define as value...
Paul P. Maglio, Savitha Srinivasan, Jeffrey T. Kre...
IJUFKS
2000
111views more  IJUFKS 2000»
14 years 10 months ago
A Factorized Representation of Independence of Causal Influence and Lazy Propagation
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Anders L. Madsen, Bruce D'Ambrosio
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
15 years 4 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
MOBICOM
2012
ACM
13 years 1 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
COCOON
2009
Springer
15 years 5 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...
« Prev « First page 1109 / 1302 Last » Next »