Sciweavers

1921 search results - page 310 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
VTC
2007
IEEE
192views Communications» more  VTC 2007»
14 years 3 months ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...
CPAIOR
2007
Springer
14 years 3 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 3 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Learning noise
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
Michael D. Schmidt, Hod Lipson
VLDB
2007
ACM
121views Database» more  VLDB 2007»
14 years 3 months ago
CellSort: High Performance Sorting on the Cell Processor
In this paper we describe the design and implementation of CellSort − a high performance distributed sort algorithm for the Cell processor. We design CellSort as a distributed b...
Bugra Gedik, Rajesh Bordawekar, Philip S. Yu