1578 search results - page 58 / 316 » Direct Routing: Algorithms and Complexity |
148
Voted
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
110
Voted
EUC
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
148
Voted
DIAL
2004
IEEE
15 years 6 months ago
2004
IEEE
A new text line location and separation algorithm for complex handwritten documents is proposed. The algorithm is based on the application of a fuzzy directional runlength. The pr...
166
Voted
EURODAC
1995
IEEE
15 years 6 months ago
1995
IEEE
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
144
Voted
IWCMC
2006
ACM
15 years 8 months ago
2006
ACM
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...