Sciweavers

112 search results - page 19 / 23
» Searching Game Trees in Parallel Using SSS
Sort
View
SOFSEM
2000
Springer
15 years 6 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
119
Voted
CLUSTER
2005
IEEE
15 years 8 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
130
Voted
COMCOM
2004
89views more  COMCOM 2004»
15 years 2 months ago
QROUTE: an QoS-guaranteed multicast routing
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
Jinquan Dai, Touchai Angchuan, Hung Keng Pung
135
Voted
IPPS
2007
IEEE
15 years 8 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
113
Voted
IJCAI
2007
15 years 4 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern