Sciweavers

446 search results - page 59 / 90
» Using a genetic algorithm approach to solve the dynamic chan...
Sort
View
VTC
2008
IEEE
224views Communications» more  VTC 2008»
14 years 3 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
13 years 9 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
FM
2005
Springer
112views Formal Methods» more  FM 2005»
14 years 2 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
RECOMB
1997
Springer
14 years 27 days ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
ECCV
2002
Springer
14 years 10 months ago
Minimal Surfaces for Stereo
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
Chris Buehler, Steven J. Gortler, Michael F. Cohen...