13376 search results - page 348 / 2676 » Problem Solving with |
133
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
136
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
113
click to vote
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
109
Voted
PERCOM
2006
ACM
16 years 4 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
149
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...