Sciweavers

452 search results - page 36 / 91
» Indexed Containers
Sort
View
EJC
2010
13 years 8 months ago
The flipping puzzle on a graph
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Hau-wen Huang, Chih-wen Weng
AROBOTS
1998
113views more  AROBOTS 1998»
13 years 8 months ago
Grounding Mundane Inference in Perception
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
Ian Horswill
CP
2009
Springer
13 years 6 months ago
The Proper Treatment of Undefinedness in Constraint Languages
Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This p...
Alan M. Frisch, Peter J. Stuckey
ADAEUROPE
2003
Springer
14 years 1 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
NGITS
1997
Springer
14 years 18 days ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross