Sciweavers

5606 search results - page 668 / 1122
» Randomization Techniques for Graphs.
Sort
View
CEC
2011
IEEE
14 years 7 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
ICSM
2008
IEEE
16 years 1 months ago
Change impact analysis for AspectJ programs
Change impact analysis is a useful technique for software evolution. It determines the effects of a source editing session and provides valuable feedbacks to the programmers for m...
Sai Zhang, Zhongxian Gu, Yu Lin, Jianjun Zhao
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 11 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
APSEC
2003
IEEE
15 years 10 months ago
Rigorous EBNF-based Definition for a Graphic Modeling Language
Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In par...
Yong Xia, Martin Glinz
LISP
2008
96views more  LISP 2008»
15 years 6 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal