3422 search results - page 517 / 685 » Random Subset Optimization |
111
click to vote
STOC
1995
ACM
15 years 6 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
133
click to vote
AAAI
2008
15 years 5 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
146
click to vote
AIPS
2007
15 years 5 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
124
Voted
ISQED
2010
IEEE
15 years 5 months ago
2010
IEEE
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
124
click to vote
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
This paper addresses the problem of engineering energy-efficient target detection applications using unattended Wireless Sensor Networks (WSNs) for long-lasting surveillance of are...