Sciweavers

5090 search results - page 954 / 1018
» Constructing Strategies for Programming
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 7 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
141
Voted
ERLANG
2003
ACM
15 years 7 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
94
Voted
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 7 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
120
Voted
AINA
2010
IEEE
15 years 7 months ago
Minimizing Execution Costs when Using Globally Distributed Cloud Services
Cloud computing is an emerging technology that allows users to utilize on-demand computation, storage, data and services from around the world. However, Cloud service providers ch...
Suraj Pandey, Adam Barker, Kapil Kumar Gupta, Rajk...
ICALP
2010
Springer
15 years 7 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket