450 search results - page 79 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
152
click to vote
ICPP
2005
IEEE
15 years 11 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
128
click to vote
JELIA
2004
Springer
15 years 10 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
166
click to vote
NOSSDAV
2009
Springer
15 years 10 months ago
2009
Springer
For scalability of business, multiparty multilevel digital rights management (DRM) architecture, where a multimedia content is delivered by an owner to a consumer through several ...
158
click to vote
CAV
2001
Springer
15 years 10 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
149
click to vote
COLT
2000
Springer
15 years 9 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...