12015 search results - page 1989 / 2403 » Interactive Algorithms 2005 |
146
click to vote
COCO
2005
Springer
16 years 11 days ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
167
click to vote
COCO
2005
Springer
16 years 11 days ago
2005
Springer
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
163
Voted
COCOON
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
153
click to vote
COCOON
2005
Springer
16 years 11 days ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
183
click to vote
COCOON
2005
Springer
16 years 11 days ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...