699 search results - page 53 / 140 » The method of combinatorial telescoping |
134
Voted
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
99
Voted
EUROCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
105
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
89
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...