Sciweavers

2080 search results - page 81 / 416
» Measuring empirical computational complexity
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
GI
2009
Springer
13 years 7 months ago
Combined Optimization of Aircraft Maneuvers and RF Measurements for Passive Air-Air Ranging
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...
Ronald Matthew Yannone, Melvin Carroll
ICIP
2008
IEEE
14 years 11 months ago
Complexity modeling of H.264 entropy decoding
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...
Zhan Ma, Zhongbo Zhang, Yao Wang
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
Fundamental Rate-Reliability-Complexity Limits in Outage Limited MIMO Communications
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...
Petros Elia, Joakim Jalden
WECWIS
2007
IEEE
119views ECommerce» more  WECWIS 2007»
14 years 4 months ago
Towards an Objective Assessment of Centrality Measures in Reputation Systems
Reputation systems facilitate cooperation in open environments. Centrality-based reputation systems use centrality measures to rank individuals, i.e., compute their reputation bas...
Christian von der Weth, Klemens Böhm