539 search results - page 75 / 108 » An Improved Upper Bound for SAT |
113
click to vote
GECCO
2011
Springer
14 years 3 months ago
2011
Springer
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...
TCC
2012
Springer
13 years 7 months ago
2012
Springer
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
101
click to vote
ECRTS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
ECCC
2006
14 years 11 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
109
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper discusses the question: Can we improve the recognition of objects by using their spatial context? We start from Bag-of-Words models and use the Pascal 2007 dataset. We u...