8728 search results - page 255 / 1746 » On Reduct Construction Algorithms |
199
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
The shaky ladder hyperplane-defined functions (sl-hdf's) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. We present...
188
click to vote
CAV
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tab...
174
click to vote
NAACL
2007
15 years 8 months ago
2007
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
203
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
181
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...