Sciweavers

1428 search results - page 39 / 286
» aim 2010
Sort
View
DAM
2010
116views more  DAM 2010»
13 years 8 months ago
Minimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
DEBU
2010
265views more  DEBU 2010»
13 years 8 months ago
GeoLife: A Collaborative Social Networking Service among User, Location and Trajectory
People travel in the real world and leave their location history in a form of trajectories. These trajectories do not only connect locations in the physical world but also bridge ...
Yu Zheng, Xing Xie, Wei-Ying Ma
ENDM
2010
105views more  ENDM 2010»
13 years 8 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...
ENDM
2010
141views more  ENDM 2010»
13 years 8 months ago
Solving Replica Placement and Request Distribution in Content Distribution Networks
A Content Distribution Network (CDN) is an overlay network where servers replicate contents and distribute client's requests with the aim at reducing delay, server load and n...
Tiago Araújo Neves, Lúcia Maria de A...
ENTCS
2010
90views more  ENTCS 2010»
13 years 8 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...