21324 search results - page 383 / 4265 » Making the case for computing |
165
click to vote
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
151
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Screen readers can drive braille devices for allowing visually impaired users to access computer environments, by providing them the same information as sighted users. But in some...
149
Voted
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
141
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
169
click to vote
CP
2011
Springer
14 years 4 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...