2681 search results - page 190 / 537 » Problem F |
CP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
48
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
131
Voted
JGO
2011
14 years 3 months ago
2011
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...
Publication
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
116
click to vote
MOBICOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...