Sciweavers

3678 search results - page 37 / 736
» On the Stable Paths Problem
Sort
View
SMA
2010
ACM
206views Solid Modeling» more  SMA 2010»
13 years 7 months ago
A generalization for stable mixed finite elements
Mixed finite element methods solve a PDE involving two or more variables. In typical problems from electromagnetics and electrodiffusion, the degrees of freedom associated to the ...
Andrew Gillette, Chandrajit L. Bajaj
ASIAMS
2007
IEEE
14 years 4 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
CATA
2004
13 years 11 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
14 years 1 months ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang
COCO
2000
Springer
123views Algorithms» more  COCO 2000»
14 years 2 months ago
A Lower Bound for the Shortest Path Problem
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
Ketan Mulmuley, Pradyut Shah