329 search results - page 15 / 66 » New lower bounds for some spherical designs |
WOWMOM
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we build on known bounds on localization in sensor networks and provide new insights that can be used in multiple-access design from a localization perspective. Spe...
CCECE
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
SAT
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...