807 search results - page 24 / 162 » Competition Adds Complexity |
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
The current paper uses a scenario from logistics to show that modern heuristics, and in particular particle swarm optimization (PSO) can significantly add to the improvement of sta...
COMPLEX
2009
Springer
14 years 5 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
EDBT
2010
ACM
14 years 5 months ago
2010
ACM
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...