Sciweavers

2099 search results - page 241 / 420
» Distributed constraint optimization with structured resource...
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 5 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
169
Voted
AISS
2010
146views more  AISS 2010»
14 years 10 months ago
Zatara, the Plug-in-able Eventually Consistent Distributed Database
With the proliferation of the computer Cloud, new software delivery methods were created. In order to build software to fit into one of these models, a scalable, easy to deploy st...
Bogdan Carstoiu, Dorin Carstoiu
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 3 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
ATAL
2010
Springer
15 years 4 months ago
Resource-bounded alternating-time temporal logic
Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools ...
Natasha Alechina, Brian Logan, Nguyen Hoang Nga, A...
RTCSA
2008
IEEE
15 years 9 months ago
Providing Memory QoS Guarantees for Real-Time Applications
Nowadays, systems often integrate a variety of applications whose service requirements are heterogeneous. Consequently, systems must be able to concurrently serve applications whi...
Audrey Marchand, Patricia Balbastre, Ismael Ripoll...