15033 search results - page 213 / 3007 » Complexity Theory and Algorithms |
108
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
162
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
121
click to vote
ALDT
2009
Springer
15 years 11 months ago
2009
Springer
Most work in game theory is conducted under the assumption that the players are expected utility maximizers. Expected utility is a very tractable decision model, but is prone to w...
355
click to vote
SYNASC
2008
IEEE
15 years 10 months ago
2008
IEEE
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
150
click to vote
TMA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Network traffic classification and anomaly detection have received much attention in the last few years. However, due to the the lack of common ground truth, proposed met...