65 search results - page 1 / 13 » Reducing Computational Costs in the Basic Perturbation Lemma |
CASC
2006
Springer
13 years 9 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
AUTOMATICA
2007
13 years 5 months ago
2007
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs with a parameter in the cost, or equivalently the right-...
ASM
2010
ASM
13 years 8 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
KIVS
1999
Springer
13 years 10 months ago
1999
Springer
: Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduc...
GCC
2007
Springer
13 years 12 months ago
2007
Springer
Many Internet applications use overlay networks as their basic facilities, like resource sharing, collaborative computing, and so on. Considering the communication cost, most over...