1291 search results - page 41 / 259 » Computing the multiplicity structure in solving polynomial s... |
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The Macaulay2 package PHCpack.m2 provides an interface to some of the functionality of PHCpack, a general-purpose solver for polynomial systems by homotopy continuation. The main f...
INDIASE
2009
ACM
14 years 2 months ago
2009
ACM
A software architect engages in solving Software Engineering (SE) problems throughout his career. Thus inculcating problem solving skills should be one of the learning objectives ...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...