2069 search results - page 401 / 414 » Linear time algorithms for Clobber |
JGT
2007
14 years 9 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
TWC
2008
14 years 9 months ago
2008
In this paper we introduce a novel linear precoding technique. The approach used for the design of the precoding matrix is general and the resulting algorithm can address several o...
78
Voted
CCE
2004
14 years 9 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
132
click to vote
ESA
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...