3281 search results - page 389 / 657 » Bases for parametrized iterativity |
164
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
214
click to vote
Publication
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
164
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
179
click to vote
ASMTA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
181
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...