Sciweavers

433 search results - page 75 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
AAAI
1994
13 years 11 months ago
Prediction Sharing Across Time and Contexts
Sometimes inferences made at some specific time are valid at other times, too. In model-based diagnosis and monitoring as well as qualitative simulation inferences are often re-do...
Oskar Dressler, Hartmut Freitag
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 9 months ago
Two Remarkable Computational Competencies of the Simple Genetic Algorithm
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
Keki M. Burjorjee
DISOPT
2007
109views more  DISOPT 2007»
13 years 9 months ago
Sequential pairing of mixed integer inequalities
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
TKDE
2008
121views more  TKDE 2008»
13 years 9 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 9 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan