Sciweavers

3333 search results - page 85 / 667
» Optimal Power-Down Strategies
Sort
View
AI
2010
Springer
15 years 4 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
P2P
2007
IEEE
107views Communications» more  P2P 2007»
15 years 10 months ago
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
Dimitri do B. DeFigueiredo, Balaji Venkatachalam, ...
ICASSP
2011
IEEE
14 years 8 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
INFOCOM
2011
IEEE
14 years 8 months ago
Delay-bounded adaptive UFH-based anti-jamming wireless communication
—Anti-jamming communication without pre-shared secrets has gained increasing research interest recently and is commonly tackled by utilizing the technique of uncoordinated freque...
Qian Wang, Ping Xu, Kui Ren, Xiang-yang Li
COMAD
2008
15 years 6 months ago
Runtime Optimization of Continuous Queries
In data stream processing systems, Quality of Service (or QoS) requirements, as specified by users, are extremely important. Unlike in a database management system (DBMS), a query...
Balakumar Kendai, Sharma Chakravarthy