13376 search results - page 2502 / 2676 » Problem Solving with |
122
Voted
EWSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
117
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Services like Amazon’s Mechanical Turk have opened the door for exploration of processes that outsource computation to humans. These human computation processes hold tremendous ...
134
click to vote
SIGMETRICS
2010
ACM
15 years 8 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
150
Voted
AGENTS
2001
Springer
15 years 8 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
143
Voted
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...