Sciweavers

13376 search results - page 461 / 2676
» Problem Solving with
Sort
View
EUROPAR
2003
Springer
15 years 10 months ago
Parallelization with Tree Skeletons
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
ICAI
2004
15 years 6 months ago
Odin and Hodur: Using Bluetooth Communication for Coordinated Robotic Search
This paper describes a multi-robot system designed to use Bluetooth wireless communication to solve the "Honeybee" task. The Honeybee task is a simple search and navigat...
D. H. Barnhard, J. T. McClain, Bradley J. Wimpey, ...
134
Voted
AIPS
2008
15 years 7 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
129
Voted
IEEECIT
2010
IEEE
15 years 3 months ago
A Recognizer of Rational Trace Languages
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
Federico Maggi
JDA
2006
83views more  JDA 2006»
15 years 5 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki