Sciweavers

2899 search results - page 212 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
IPPS
2003
IEEE
16 years 11 days ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
197
Voted
INFOCOM
2012
IEEE
13 years 9 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
180
Voted
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
16 years 13 days ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
ICC
2009
IEEE
210views Communications» more  ICC 2009»
16 years 1 months ago
Weighted Sum-Rate Maximization Using Weighted MMSE for MIMO-BC Beamforming Design
—This paper studies linear transmit filter design for Weighted Sum-Rate (WSR) maximization in the Multiple Input Multiple Output Broadcast Channel (MIMO-BC). The problem of fin...
Søren Skovgaard Christensen, Rajiv Agarwal,...
JAR
2007
142views more  JAR 2007»
15 years 7 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler