Sciweavers

3637 search results - page 311 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 25 days ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
AOSD
2007
ACM
15 years 10 months ago
Debugging with control-flow breakpoints
Modern source-level debuggers support dynamic breakpoints that are guarded by conditions based on program state. Such breakpoints address situations where a static breakpoint is n...
Rick Chern, Kris De Volder
GECCO
2008
Springer
180views Optimization» more  GECCO 2008»
15 years 7 months ago
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...
Saheeb Ahmed Kayani, Muhammad Afzaal Malik
ISCAS
2007
IEEE
79views Hardware» more  ISCAS 2007»
16 years 29 days ago
Quadrature Mismatch Shaping Techniques for Fully Differential Circuits
— Quadrature Σ∆ ADCs require a feedback path for both the I and the Q part of the complex feedback signal. A complex DAC could give this feedback with near-perfect I/Q balance...
Stijn Reekmans, Pieter Rombouts, Ludo Weyten
DATE
2010
IEEE
163views Hardware» more  DATE 2010»
15 years 11 months ago
Efficient High-Level modeling in the networking domain
-- Starting Electronic System Level (ESL) design flows with executable High-Level Models (HLMs) has the potential to sustainably improve productivity. However, writing good HLMs fo...
Christian Zebelein, Joachim Falk, Christian Haubel...