Sciweavers

30 search results - page 1 / 6
» Cluster-cover a theoretical framework for a class of VLSI-CA...
Sort
View
16
Voted
TODAES
1998
51views more  TODAES 1998»
13 years 7 months ago
Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems
C.-J. Richard Shi, Janusz A. Brzozowski
JMLR
2012
11 years 10 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
CSR
2009
Springer
13 years 11 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
MP
2006
75views more  MP 2006»
13 years 7 months ago
A Class of stochastic programs with decision dependent uncertainty
We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
Vikas Goel, Ignacio E. Grossmann
TCS
2010
13 years 6 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin