1920 search results - page 230 / 384 » The Complexity of the A B C Problem |
180
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
139
click to vote
CPAIOR
2009
Springer
16 years 18 days ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
157
click to vote
SYNASC
2006
IEEE
16 years 1 days ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
165
click to vote
ISCA
2007
IEEE
16 years 10 days ago
2007
IEEE
Speculative compiler optimizations are effective in improving both single-thread performance and reducing power consumption, but their implementation introduces significant compl...
190
click to vote
BROADNETS
2005
IEEE
15 years 11 months ago
2005
IEEE
— Lightweight protocols that are both bandwidth and power thrifty are desirable for sensor networks. In addition, for many sensor network applications, timeliness of data deliver...