264 search results - page 45 / 53 » First order LUB approximations: characterization and algorit... |
WDAG
1990
Springer
15 years 3 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we present a soft computing system developed to optimize the face milling operation under High Speed conditions in the manufacture of steel components like molds with...
FMCAD
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
ATAL
2003
Springer
15 years 4 months ago
2003
Springer
Traditional goal-oriented approaches to building intelligent agents only consider absolute satisfaction of goals. However, in continuous domains there may be many instances in whi...