Sciweavers

2996 search results - page 239 / 600
» Numberings and Randomness
Sort
View
IPL
2006
95views more  IPL 2006»
15 years 6 months ago
Smaller superconcentrators of density 28
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Uwe Schöning
COR
2004
127views more  COR 2004»
15 years 6 months ago
Towards the real time solution of strike force asset allocation problems
The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximiz...
Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd
ASIACRYPT
2010
Springer
15 years 4 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
EVOW
2009
Springer
15 years 4 months ago
Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6th International Planning Competition
Divide-and-Evolve (DAE) is the first evolutionary planner that has entered the biennial International Planning Competition (IPC). Though the overall results were disappointing, a d...
Jacques Bibai, Marc Schoenauer, Pierre Savé...
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
13 years 9 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor