Sciweavers

480 search results - page 41 / 96
» Approximate and exact algorithms for the fixed-charge knapsa...
Sort
View
MOBIHOC
2010
ACM
13 years 7 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
ATAL
2008
Springer
13 years 11 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 9 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
SENSYS
2003
ACM
14 years 2 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
ICML
2010
IEEE
13 years 10 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes