14649 search results - page 447 / 2930 » Principles of problem solving |
193
click to vote
MP
2010
15 years 5 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
179
click to vote
NA
2010
15 years 5 months ago
2010
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
196
Voted
COLOGNETWENTE
2010
15 years 3 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
163
click to vote
CDC
2010
IEEE
15 years 1 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...
154
click to vote
PERCOM
2006
ACM
16 years 6 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)...