Sciweavers

4037 search results - page 80 / 808
» Routing without ordering
Sort
View
MOC
2002
98views more  MOC 2002»
13 years 8 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
MOBIHOC
2003
ACM
14 years 8 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
BSL
2005
106views more  BSL 2005»
13 years 9 months ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov
TIM
2010
79views Education» more  TIM 2010»
13 years 3 months ago
Desired Order Continuous Polynomial Time Window Functions for Harmonic Analysis
Abstract--An approach for the construction of a family of desired order continuous polynomial time window functions is presented without self-convolution of the parent window. The ...
P. Singla, T. Singh
CBMS
2007
IEEE
14 years 3 months ago
Increasing Acceptability of Decision Trees with Domain Attributes Partial Orders
There are several domains, such as health-care, in which the decision process usually has a background knowledge that must be considered. We need to maximize the accuracy of the m...
Joan Albert López-Vallverdú, David R...