Sciweavers

5889 search results - page 807 / 1178
» Graph Layout Problems
Sort
View
ADHOCNOW
2008
Springer
15 years 8 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
CSL
2010
Springer
15 years 8 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
158
Voted
AHSWN
2010
105views more  AHSWN 2010»
15 years 7 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
CORR
2010
Springer
145views Education» more  CORR 2010»
15 years 7 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
CVGIP
2008
108views more  CVGIP 2008»
15 years 7 months ago
Efficient texture synthesis using strict Wang Tiles
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
Xinyu Zhang, Young J. Kim