Sciweavers

59 search results - page 4 / 12
» Iterative Lexicographic Path Orders
Sort
View
MOBIHOC
2004
ACM
14 years 7 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
FUIN
2002
76views more  FUIN 2002»
13 years 7 months ago
Making revision reversible: an approach based on polynomials
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the in...
Salem Benferhat, Didier Dubois, Sylvain Lagrue, Od...
MP
2008
129views more  MP 2008»
13 years 7 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
ICPP
2000
IEEE
14 years 9 days ago
Partitioning Loops with Variable Dependence Distances
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for ...
Yijun Yu, Erik H. D'Hollander
JMIV
2000
86views more  JMIV 2000»
13 years 7 months ago
Vector Median Filters, Inf-Sup Operations, and Coupled PDE's: Theoretical Connections
In this paper, we formally connect between vector median filters, inf-sup morphological operations, and geometric partial differential equations. Considering a lexicographic order,...
Vicent Caselles, Guillermo Sapiro, Do Hyun Chung