9631 search results - page 1904 / 1927 » The Costs of Using JXTA |
115
click to vote
CONSTRAINTS
2010
14 years 12 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
110
click to vote
COR
2008
14 years 12 months ago
2008
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...