420 search results - page 14 / 84 » Some Algorithmic Problems in Polytope Theory |
112
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
SIGACT
2010
14 years 8 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
58
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
STOC
1989
ACM
15 years 1 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
73
Voted
AAAI
2004
14 years 11 months ago
2004
In this paper we report some of the research endeavors we are embarking on as part of the Doctoral research of the first author. We have already completed an investigation of some...