4036 search results - page 421 / 808 » Formal Methods |
180
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
185
click to vote
APAL
2010
15 years 7 months ago
2010
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
198
click to vote
FUIN
2008
15 years 6 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
200
click to vote
IAJIT
2010
15 years 5 months ago
2010
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
187
click to vote
TCS
2010
15 years 5 months ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...