Sciweavers

3825 search results - page 511 / 765
» More on pooling spaces
Sort
View
ICALP
2007
Springer
16 years 1 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
ILP
2007
Springer
16 years 1 months ago
Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
Tom Croonenborghs, Kurt Driessens, Maurice Bruynoo...
ISAAC
2007
Springer
120views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Succinct Representation of Labeled Graphs
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
Jérémy Barbay, Luca Castelli Aleardi...
LCPC
2007
Springer
16 years 1 months ago
Multidimensional Blocking in UPC
Abstract. Partitioned Global Address Space (PGAS) languages offer an attractive, high-productivity programming model for programming large-scale parallel machines. PGAS languages, ...
Christopher Barton, Calin Cascaval, George Alm&aac...
LCPC
2007
Springer
16 years 1 months ago
Automatic Communication Performance Debugging in PGAS Languages
Recent studies have shown that programming in a Partition Global Address Space (PGAS) language can be more productive than programming in a message passing model. One reason for th...
Jimmy Su, Katherine A. Yelick