16404 search results - page 761 / 3281 » A set coverage problem |
187
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
221
click to vote
MATES
2009
Springer
16 years 2 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
200
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
200
click to vote
SIGECOM
2006
ACM
16 years 1 months ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
176
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...