1712 search results - page 224 / 343 » A Computational Approach to Binding Theory |
178
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
168
click to vote
EUROPAR
1998
Springer
15 years 10 months ago
1998
Springer
This paper aims to improve locality of references by suitably choosing array layouts. We use a new definition of spatial reuse vectors that takes into account memory layout of arra...
174
click to vote
JELIA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
162
click to vote
ECOOPW
1997
Springer
15 years 10 months ago
1997
Springer
An object-oriented (OO) model has a static component, the set of allowable snapshots or system states, and a dynamic component, the set of filmstrips or sequences of snapshots. Dia...
160
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
Pervasive learning promises an exciting learning environment such that users can access content and study them at anytime, anywhere, through any devices. Besides delivering the ri...