14190 search results - page 2518 / 2838 » computing 2008 |
130
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
117
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
130
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
128
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
145
click to vote
SAT
2009
Springer
15 years 11 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...