1662 search results - page 124 / 333 » The Computational Complexity of Agent Design Problems |
130
click to vote
DAC
1999
ACM
15 years 8 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
133
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
123
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
150
click to vote
ADC
2008
Springer
15 years 10 months ago
2008
Springer
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
131
Voted
AAAI
2007
15 years 6 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...