Sciweavers

3406 search results - page 121 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 4 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
104
Voted
ICLP
2003
Springer
15 years 8 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski
133
Voted
FPGA
1995
ACM
113views FPGA» more  FPGA 1995»
15 years 6 months ago
High-Energy Physics on DECPeRLe-1 Programmable Active Memory
The future Large Hadron Collider (LHC) to be built at CERN1, by the turn of the millenium, provides an ample source of challenging real-time computational problems. We report here...
Laurent Moll, Jean Vuillemin, Philippe Boucard
COMGEO
2010
ACM
15 years 3 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
CODES
2007
IEEE
15 years 4 months ago
Incremental run-time application mapping for homogeneous NoCs with multiple voltage levels
In this paper, we propose an efficient technique for run-time application mapping onto Network-on-Chip (NoC) platforms with multiple voltage levels. Our technique consists of a re...
Chen-Ling Chou, Radu Marculescu