Sciweavers

1253 search results - page 204 / 251
» Convergence of Evolutionary Algorithms in General Search Spa...
Sort
View
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 10 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
ATAL
2009
Springer
16 years 23 days ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
CP
2005
Springer
15 years 11 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
ICRA
2005
IEEE
142views Robotics» more  ICRA 2005»
15 years 11 months ago
Correspondenceless Ego-Motion Estimation Using an IMU
Abstract— Mobile robots can be easily equipped with numerous sensors which can aid in the tasks of localization and ego-motion estimation. Two such examples are Inertial Measurem...
Ameesh Makadia, Kostas Daniilidis
WALCOM
2010
IEEE
230views Algorithms» more  WALCOM 2010»
16 years 1 months ago
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
Guillaume Blin, Sylvie Hamel, Stéphane Vial...