Sciweavers

4843 search results - page 424 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
GLOBECOM
2006
IEEE
15 years 11 months ago
Adaptive Coding and Modulation for Hybrid ARQ Systems over Partially Observable Nakagami-m Fading Channels
— We study coding and modulation rate adaptation problem for HARQ systems with partially observable state from cross-layer viewpoint. The rate of convolutionally coded MQAM is ad...
Ashok K. Karmokar, Vijay K. Bhargava
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
15 years 10 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu
153
Voted
ADHOCNOW
2005
Springer
15 years 10 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
PPDP
2005
Springer
15 years 10 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
STACS
1999
Springer
15 years 9 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin