Sciweavers

504 search results - page 46 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
TMI
2002
115views more  TMI 2002»
13 years 9 months ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
JCSS
2002
86views more  JCSS 2002»
13 years 9 months ago
A New Proof of the Weak Pigeonhole Principle
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
Alexis Maciel, Toniann Pitassi, Alan R. Woods
IAT
2009
IEEE
14 years 4 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
IWSM
2000
Springer
14 years 1 months ago
CEOS - A Cost Estimation Method for Evolutionary, Object-Oriented Software Development
: In this article we present a method for estimating the effort of software projects following an evolutionary, object-oriented development paradigm. Effort calculation is based on...
Siar Sarferaz, Wolfgang Hesse