1092 search results - page 127 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
157
click to vote
CDC
2008
IEEE
16 years 19 days ago
2008
IEEE
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
165
click to vote
INFOCOM
2007
IEEE
16 years 14 days ago
2007
IEEE
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
135
click to vote
FUN
2007
Springer
16 years 9 days ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
146
click to vote
ACMSE
2006
ACM
16 years 4 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
166
Voted
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...