Sciweavers

1576 search results - page 70 / 316
» Properties of Synthetic Optimization Problems
Sort
View
IPL
2011
91views more  IPL 2011»
13 years 5 months ago
A note on improving the performance of approximation algorithms for radiation therapy
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
Therese C. Biedl, Stephane Durocher, Holger H. Hoo...
JAIR
2011
84views more  JAIR 2011»
13 years 5 months ago
Evaluating Temporal Graphs Built from Texts via Transitive Reduction
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...
Xavier Tannier, Philippe Muller
ICCV
2005
IEEE
14 years 12 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
14 years 3 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
UAI
2003
13 years 11 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins