681 search results - page 134 / 137 » General Polynomial Time Decomposition Algorithms |
149
click to vote
QEST
2008
IEEE
15 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
151
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Trust management is a form of access control that uses delegation to achieve scalability beyond a single organization or federation. However, delegation can be difficult to contr...
182
click to vote
MOBIQUITOUS
2007
IEEE
15 years 11 months ago
2007
IEEE
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
134
click to vote
ATAL
2003
Springer
15 years 10 months ago
2003
Springer
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...
153
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...