Sciweavers

1289 search results - page 41 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SIPS
2006
IEEE
14 years 5 months ago
A Low Cost Packet Detector in OFDM-Based Ultra-Wideband Systems
Multiband orthogonal frequency-division multiplexing (MB-OFDM) systems employ frequency-hopping technology to achieve the capabilities of multiple access and frequency diversity. ...
Jyh-Ting Lai, Chun-Yuan Chu, An-Yeu Wu, Wen-Chiang...
EUC
2008
Springer
14 years 22 days ago
Performance Comparison of Techniques on Static Path Analysis of WCET
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
Mingsong Lv, Zonghua Gu, Nan Guan, Qingxu Deng, Ge...
AAAI
2004
14 years 12 days ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
14 years 4 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
AIPS
2003
14 years 11 days ago
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
Jeremy Frank, Elif Kürklü