660 search results - page 90 / 132 » Hybrid CSP Solving |
134
Voted
SIAMJO
2008
15 years 3 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
141
Voted
LATINCRYPT
2010
15 years 2 months ago
2010
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...
133
Voted
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
132
click to vote
WISEC
2009
ACM
15 years 10 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
130
click to vote
FDL
2005
IEEE
15 years 9 months ago
2005
IEEE
The support of heterogeneity at the specification level, that is, the ability to mix several models of computation (MoCs) in the system-level specification, is becoming increasing...