1716 search results - page 255 / 344 » Proving Conditional Termination |
111
click to vote
ISMVL
2009
IEEE
15 years 10 months ago
2009
IEEE
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
128
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
130
Voted
WAW
2009
Springer
15 years 10 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
121
Voted
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...
107
click to vote
COSIT
2009
Springer
15 years 10 months ago
2009
Springer
We propose an empirical, perception-based evaluation approach for assessing the effectiveness and efficiency of longstanding cartographic design principles applied to 2D map displa...