Sciweavers

12950 search results - page 387 / 2590
» On Optimal Timed Strategies
Sort
View
RTS
2010
121views more  RTS 2010»
15 years 5 months ago
A compiler framework for the reduction of worst-case execution times
The current practice to design software for real-time systems is tedious. There is almost no tool support that assists the designer in automatically deriving safe bounds of the wor...
Heiko Falk, Paul Lokuciejewski
DCC
2002
IEEE
16 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
16 years 2 days ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
EVOW
2009
Springer
16 years 1 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
ICC
2007
IEEE
16 years 1 months ago
A Space-Time Code Design for Partial-Response CPM: Diversity Order and Coding Gain
— Using a linear decomposition of continuous phase modulated (CPM) signals with tilted-phase, sufficient conditions are derived under which M-ary partial-response CPM spacetime ...
Alenka G. Zajic, Gordon L. Stüber