Sciweavers

653 search results - page 108 / 131
» The size of minimum 3-trees
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
14 years 12 months ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 12 months ago
Cross Layer Aware Adaptive MAC based on Knowledge Based Reasoning for Cognitive Radio Computer Networks
: In this paper we are proposing a new concept in MAC layer protocol design for Cognitive radio by combining information held by physical layer and MAC layer with analytical engine...
Vibhar Pathak, Krishna Chandra Roy, Santosh Kumar ...
CORR
2010
Springer
97views Education» more  CORR 2010»
14 years 12 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
DAM
2008
87views more  DAM 2008»
14 years 12 months ago
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
EOR
2008
110views more  EOR 2008»
14 years 12 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...