537 search results - page 37 / 108 » A new upper bound for 3-SAT |
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
SPAA
1994
ACM
14 years 17 days ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
ICMCS
2005
IEEE
14 years 2 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...
ACL
1990
13 years 9 months ago
1990
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...