874 search results - page 144 / 175 » Computing Weighted Solutions in Answer Set Programming |
94
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
143
click to vote
ISAAC
2010
Springer
15 years 11 days ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
201
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
122
click to vote
CHI
2005
ACM
16 years 2 months ago
2005
ACM
This workshop aims to gather researchers in the field of user interface design tools to identify important themes for the next decade of research. These tools aid in the design an...
135
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
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...