1071 search results - page 143 / 215 » Programming with enumerable sets of structures |
125
click to vote
CPAIOR
2004
Springer
15 years 6 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
118
click to vote
PPDP
2000
Springer
15 years 6 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
120
Voted
CAL
2006
15 years 3 months ago
2006
Multiple core designs have become commonplace in the processor market, and are hence a major focus in modern computer architecture research. Thus, for both product development and ...
107
click to vote
MP
2008
15 years 2 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
126
click to vote
SIAMDM
2010
14 years 9 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...