Sciweavers

14649 search results - page 469 / 2930
» Principles of problem solving
Sort
View
ASIACRYPT
2006
Springer
15 years 10 months ago
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
Gregor Leander, Andy Rupp
SOCO
2009
Springer
16 years 1 months ago
Language Design for Meta-programming in the Software Composition Domain
How would a language look like that is specially designed for solving meta-programming problems in the software composition domain? We present requirements for and design of Rascal...
Paul Klint, Jurgen J. Vinju, Tijs van der Storm
ENTCS
2008
108views more  ENTCS 2008»
15 years 7 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry
COR
2006
86views more  COR 2006»
15 years 7 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover
ICASSP
2011
IEEE
14 years 10 months ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...