1017 search results - page 16 / 204 » Some existence and construction results of polygonal designs |
IJCAI
2003
13 years 8 months ago
2003
Ensemble methods like bagging and boosting that combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity of the memb...
AE
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
CIE
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
The fast growth and spread of Web 2.0 environments have demonstrated the great willingness of general Web users to contribute and share various type of content and information. Ma...
ISPD
2010
ACM
14 years 2 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...