903 search results - page 74 / 181 » Non-well-founded trees in categories |
194
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
130
click to vote
GECCO
2009
Springer
16 years 23 days ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
142
click to vote
ECLIPSE
2006
ACM
16 years 5 days ago
2006
ACM
In this paper, we present the APFEL plug-in that collects finegrained changes from version archives in a database. APFEL is built upon the Eclipse infrastructure for CVS and Java....
159
click to vote
ISMVL
2005
IEEE
15 years 11 months ago
2005
IEEE
It is believed that quantum computing will begin to have a practical impact in industry around year 2010. We propose an approach to test generation and fault localization for a wi...
172
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...