Sciweavers

1104 search results - page 35 / 221
» Experimental evaluation of optimal CSMA
Sort
View
CEC
2009
IEEE
14 years 4 months ago
Gate-level optimization of polymorphic circuits using Cartesian Genetic Programming
— Polymorphic digital circuits contain ordinary and polymorphic gates. In the past, Cartesian Genetic Programming (CGP) has been applied to synthesize polymorphic circuits at the...
Zbysek Gajda, Lukás Sekanina
CP
2001
Springer
14 years 2 months ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
ICPP
2007
IEEE
14 years 4 months ago
Towards Optimized Packet Classification Algorithms for Multi-Core Network Processors
In this paper, a novel packet classification scheme optimized for multi-core network processors is proposed. The algorithm, Explicit Cuttings (ExpCuts), adopts a hierarchical spac...
Yaxuan Qi, Bo Xu, Fei He, Xin Zhou, Jianming Yu, J...
ICMAS
1998
13 years 11 months ago
How to Explore your Opponent's Strategy (almost) Optimally
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...
David Carmel, Shaul Markovitch
PR
1998
86views more  PR 1998»
13 years 9 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...