1486 search results - page 231 / 298 » Algorithms for two-box covering |
180
Voted
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
154
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
141
click to vote
FSKD
2007
Springer
15 years 10 months ago
2007
Springer
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
147
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
151
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...