5214 search results - page 837 / 1043 » The Online Specialization Problem |
160
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
203
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
191
click to vote
CCCG
2009
15 years 7 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
172
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...
142
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...