110 search results - page 8 / 22 » New Upper Bounds for Maximum Satisfiability |
JGAA
2006
14 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
89
Voted
KI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper investigates performance measures of adaptive echo cancellers for packet-based telephony. It is shown that steady-state echo return loss enhancement (ERLE) does not acc...