Sciweavers

691 search results - page 85 / 139
» Equational Abstractions
Sort
View
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 10 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
BC
2006
63views more  BC 2006»
13 years 10 months ago
Dynamic neural field with local inhibition
Abstract A lateral-inhibition type neural field model with restricted connections is presented here and represents an experimental extension of the Continuum Neural Field Theory (C...
Nicolas P. Rougier
MP
2008
129views more  MP 2008»
13 years 10 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
IJAC
2007
59views more  IJAC 2007»
13 years 10 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu