881 search results - page 113 / 177 » Solving satisfiability problems with preferences |
WINE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
IJAC
2011
12 years 11 months ago
2011
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
COMPSAC
2007
IEEE
13 years 9 months ago
2007
IEEE
The popularity of Service Oriented Computing (SOC) brings a large number of distributed, well-encapsulated and reusable services all over internet, and makes it possible to create...
COLT
2003
Springer
14 years 27 days ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
FOCS
2002
IEEE
14 years 19 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...