2479 search results - page 208 / 496 » Quantum complexity theory |
176
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
172
click to vote
UML
2001
Springer
15 years 11 months ago
2001
Springer
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
159
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
159
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
170
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...