130 search results - page 8 / 26 » Exact Algorithms for Exact Satisfiability and Number of Perf... |
WINE
2005
Springer
14 years 29 days 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...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
COMBINATORICS
2006
13 years 7 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
WEBI
2004
Springer
14 years 25 days ago
2004
Springer
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
ICWS
2004
IEEE
13 years 9 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...