Sciweavers

1101 search results - page 162 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
113
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
COCOON
2007
Springer
15 years 8 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 8 months ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
104
Voted
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 3 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
113
Voted
IPPS
2005
IEEE
15 years 8 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...