803 search results - page 94 / 161 » Independence in Direct-Product Graphs |
149
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
109
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
141
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
111
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
124
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...