3333 search results - page 468 / 667 » Optimal Power-Down Strategies |
165
click to vote
ESWA
2008
15 years 7 months ago
2008
Abstract Large temporal Databases (TDBs) usually contain a wealth of data about temporal events. Aimed at discovering temporal patterns with during relationship (during-temporal pa...
181
click to vote
COR
2006
15 years 7 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
164
click to vote
COR
2007
15 years 7 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
179
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
This paper demonstrates the significant gains that multi-access users can achieve from sharing a single amplify-forward relay in slow fading environments. The proposed protocol, ...
191
click to vote
JMLR
2008
15 years 7 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...