Sciweavers

4894 search results - page 555 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
WSC
2000
15 years 6 months ago
Simulation optimization of stochastic systems with integer variables by sequential linearization
Discrete-event simulation is widely used to analyse and improve the performance of manufacturing systems. The related optimization problem often includes integer design variables ...
S. J. Abspoel, L. F. P. Etman, J. Vervoort, J. E. ...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 5 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
ATAL
2010
Springer
15 years 5 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 4 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
JMLR
2006
138views more  JMLR 2006»
15 years 4 months ago
Noisy-OR Component Analysis and its Application to Link Analysis
We develop a new component analysis framework, the Noisy-Or Component Analyzer (NOCA), that targets high-dimensional binary data. NOCA is a probabilistic latent variable model tha...
Tomás Singliar, Milos Hauskrecht