Sciweavers

1041 search results - page 135 / 209
» Randomizing Reductions of Search Problems
Sort
View
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
13 years 11 months ago
A comparative study of immune system based genetic algorithms in dynamic environments
Diversity and memory are two major mechanisms used in biology to keep the adaptability of organisms in the everchanging environment in nature. These mechanisms can be integrated i...
Shengxiang Yang
ICGI
2010
Springer
13 years 5 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
FOCS
2007
IEEE
14 years 2 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
TELECARE
2004
184views Healthcare» more  TELECARE 2004»
13 years 9 months ago
Securing Mobile Agent Based Tele-Assistance Systems
Nowadays the scientific community is trying to design new techniques in the search for solving security problems in mobile agent technology. There are now some industry initiatives...
Sergio Pozo, Rafael M. Gasca, María Teresa ...
SIGCOMM
2012
ACM
11 years 10 months ago
Reduction-based analysis of BGP systems with BGPVerif
Today’s inter-domain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfiguration by individual autonomous system...
Anduo Wang, Alexander J. T. Gurney, Xianglong Han,...