Sciweavers

3433 search results - page 219 / 687
» Heuristics for a bidding problem
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 29 days ago
An Improved Topology Design Algorithm for Network Coding-Based Multicast Networks
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi
ICOIN
2005
Springer
16 years 4 days ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
16 years 3 days ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
PAAMS
2010
Springer
15 years 11 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
CPAIOR
2008
Springer
15 years 8 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper