2182 search results - page 28 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
COR
2008
15 years 2 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
128
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
105
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
107
click to vote
ISSRE
2007
IEEE
15 years 3 months ago
2007
IEEE
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
108
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...