5090 search results - page 437 / 1018 » Constructing Strategies for Programming |
204
click to vote
WD
2010
15 years 4 months ago
2010
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delaytolerant network. The scheme uses recent encounters to estimate the avail...
215
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
174
click to vote
UM
2009
Springer
16 years 1 months ago
2009
Springer
Clustering of search results has been shown to be advantageous over the simple list presentation of search results. However, in most clustering interfaces, the clusters are not ada...
224
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
171
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
We discover significant value-dependent programming energy variations in multi-level cell (MLC) flash memories, and introduce an energy-aware data compression method that minimize...