501 search results - page 82 / 101 » Rough Sets and Approximation Schemes |
108
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
139
click to vote
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
113
click to vote
DIALM
2003
ACM
15 years 6 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
109
Voted
MOBIHOC
2005
ACM
16 years 7 days ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
162
Voted
SBBD
2008
15 years 2 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...