Sciweavers

5115 search results - page 501 / 1023
» On Randomized Lanczos Algorithms
Sort
View
TEC
2008
165views more  TEC 2008»
15 years 6 months ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao
JCO
2007
123views more  JCO 2007»
15 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
TSP
2008
150views more  TSP 2008»
15 years 6 months ago
Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks
This study examines the problem of target detection by a wireless sensor network. Sensors acquire measurements emitted from the target that are corrupted by noise and initially ma...
Natallia Katenka, Elizaveta Levina, George Michail...
APAL
2004
105views more  APAL 2004»
15 years 6 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
ECCC
2000
93views more  ECCC 2000»
15 years 6 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg