Sciweavers

6315 search results - page 1206 / 1263
» Approximating Solution Structure
Sort
View
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
14 years 1 months ago
On implementation choices for iterative improvement partitioning algorithms
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng
VLDB
1987
ACM
90views Database» more  VLDB 1987»
14 years 1 months ago
Index Access with a Finite Buffer
: A buffer is a main-memory area used to reduce accessto disks. The buffer holds pages from secondary storage files. A processrequesting a page causesa fault if the pageis not in t...
Giovanni Maria Sacco
AAAI
2008
14 years 8 days ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
AAAI
2010
13 years 11 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
« Prev « First page 1206 / 1263 Last » Next »