Sciweavers

412 search results - page 78 / 83
» A New Proof of the F5 Algorithm
Sort
View
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
14 years 11 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
HPDC
2010
IEEE
14 years 10 months ago
Cluster-wide context switch of virtualized jobs
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
Fabien Hermenier, Adrien Lebre, Jean-Marc Menaud
SPIN
2009
Springer
15 years 4 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
ICASSP
2007
IEEE
15 years 4 months ago
Evolutionary Sequence Modeling for Discovery of Peptide Hormones
There are currently a large number of ‘‘orphan’’ G-protein-coupled receptors (GPCRs) whose endogenous ligands (peptide hormones) are unknown. Identification of these pepti...
M. Kemal Sönmez, Lawrence Toll, Nina Zaveri
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
15 years 3 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich