350 search results - page 39 / 70 » Lower and upper bounds on obtaining history independence |
142
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
166
click to vote
ATAL
2009
Springer
16 years 21 days ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
154
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract--A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting stati...
161
click to vote
HPCA
2007
IEEE
16 years 14 days ago
2007
IEEE
To provide high dependability in a multithreaded system despite hardware faults, the system must detect and correct errors in its shared memory system. Recent research has explore...
160
click to vote
AAAI
1992
15 years 7 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...