3341 search results - page 310 / 669 » On Bounded Queries and Approximation |
186
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
191
click to vote
CNSR
2004
IEEE
15 years 10 months ago
2004
IEEE
A fundamental problem that confronts future applications of sensor networks is how to efficiently locate the sensor node that stores a particular data item. It is known that distr...
186
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
168
click to vote
CSFW
2007
IEEE
16 years 1 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
178
click to vote
ESA
2005
Springer
16 years 8 days ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...