1729 search results - page 304 / 346 » Bound Graph Polysemy |
132
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
126
Voted
ICICS
2005
Springer
15 years 10 months ago
2005
Springer
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
139
Voted
PODC
2004
ACM
15 years 10 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
142
Voted
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
171
click to vote
CODES
2003
IEEE
15 years 10 months ago
2003
IEEE
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...