59 search results - page 3 / 12 » Hardness vs. Randomness within Alternating Time |
CPC
2006
13 years 7 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
ICCSA
2004
Springer
14 years 26 days ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
SAT
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
SIGMETRICS
2010
ACM
14 years 9 days ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...