9405 search results - page 1234 / 1881 » Computing a Model of Set Theory |
184
click to vote
IJCAI
2003
15 years 8 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
188
click to vote
SLP
1994
15 years 8 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
224
click to vote
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
206
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
196
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...