Sciweavers

2308 search results - page 156 / 462
» Representing Symbolic Reasoning
Sort
View
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
15 years 12 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
LICS
2008
IEEE
16 years 26 days ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
ICIP
1998
IEEE
16 years 8 months ago
Efficient Representation and Decoding of Static Huffman Code Tables in a Very Low Bit Rate Environment
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the r...
Nick B. Body, Donald G. Bailey
WWW
2001
ACM
16 years 7 months ago
Hierarchical Atomic Navigation for Small Display Devices
We present a new transcoding technique for WWW navigation on small display devices: hierarchical atomic navigation (HANd). Unlike previous techniques, HANd shows all original info...
David Conde-Lagoa, Enrique Costa-Montenegro, Franc...
CP
2009
Springer
16 years 7 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...