Sciweavers

3049 search results - page 139 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CP
2003
Springer
15 years 10 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
HEURISTICS
2008
120views more  HEURISTICS 2008»
15 years 4 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
AI
2010
Springer
15 years 1 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
TSP
2010
14 years 11 months ago
Near optimal iterative channel estimation for KSP-OFDM
In this correspondence, we propose an iterative "turbo" channel estimation algorithm for known symbol padding (KSP) orthogonal frequency-division multiplexing (OFDM), whe...
Dieter Van Welden, Heidi Steendam
JCM
2006
118views more  JCM 2006»
15 years 4 months ago
Joint Optimization of Local and Fusion Rules in a Decentralized Sensor Network
Decentralized sensor networks are collections of individual local sensors that observe a common phenomenon, quantize their observations, and send this quantized information to a ce...
Nithya Gnanapandithan, Balasubramaniam Natarajan