2796 search results - page 247 / 560 » The coolest path problem |
190
Voted
ANTSW
2004
Springer
16 years 1 days ago
2004
Springer
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
163
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
161
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
—This paper presents an end-to-end solution to the cooperative control problem represented by the scenario where unmanned air vehicles (UAVs) are assigned to transition through k...
177
Voted
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
181
click to vote
DM
1999
15 years 6 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...