3958 search results - page 54 / 792 » Dynamic Graph Algorithms with Applications |
133
click to vote
ANTSW
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
114
Voted
IJMC
2006
15 years 2 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
136
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
135
Voted
VC
2010
14 years 9 months ago
2010
High Dynamic Range (HDR) rendering has a growing success in video-games and virtual reality applications, as it improves the image quality and the player's immersion feeling....
122
Voted
AI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...