Sciweavers

1259 search results - page 115 / 252
» The load rebalancing problem
Sort
View
136
Voted
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
15 years 7 months ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou
123
Voted
PARA
1995
Springer
15 years 7 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
ATAL
2008
Springer
15 years 5 months ago
Optimized algorithms for multi-agent routing
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Akihiro Kishimoto, Nathan R. Sturtevant
106
Voted
BCSHCI
2007
15 years 5 months ago
HCI and creative problem-solving at Lancaster
The Creative Problem-Solving Research Group (CPSRG) at Lancaster University is a collaboration between psychologists and computer scientists conducting research into creativity, p...
Thomas C. Ormerod, Linden J. Ball, Alan J. Dix, Co...
TON
2008
99views more  TON 2008»
15 years 3 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly