Sciweavers

14386 search results - page 390 / 2878
» The Chinese Generals Problem
Sort
View
SIAMJO
2010
135views more  SIAMJO 2010»
15 years 5 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 7 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 7 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 9 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
SIGCSE
2004
ACM
628views Education» more  SIGCSE 2004»
16 years 8 days ago
Design patterns for semaphores
This paper describes two design patterns that are powerful tools to help teach how semaphores are used to solve synchronization problems. The patterns are general enough to be use...
Kenneth A. Reek