Sciweavers

1522 search results - page 78 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
INFOCOM
2010
IEEE
13 years 6 months ago
Resource Allocation in Multi-cell OFDMA-based Relay Networks
Abstract— Cooperative relay networks combined with Orthogonal Frequency Division Multiplexing Access (OFDMA) technology has been widely recognized as a promising candidate for fu...
Yao Hua, Qian Zhang, Zhisheng Niu
ESAW
2009
Springer
14 years 2 months ago
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
Abstract. Load-Balancing is a significant problem in heterogeneous distributed systems. There exist many load balancing algorithms, however, most approaches are very problem speci...
eva Kühn, Vesna Sesum-Cavic
ECAI
2004
Springer
14 years 1 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
ICN
2005
Springer
14 years 1 months ago
AIMD Penalty Shaper to Enforce Assured Service for TCP Flows
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
Emmanuel Lochin, Pascal Anelli, Serge Fdida