1449 search results - page 66 / 290 » Self-Randomized Exponentiation Algorithms |
159
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
174
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
141
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
172
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...
179
click to vote
IPL
2007
15 years 6 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...