Sciweavers

4112 search results - page 310 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
SIAMMAX
2010
92views more  SIAMMAX 2010»
15 years 1 months ago
Estimating the Backward Error in LSQR
We propose practical stopping criteria for the iterative solution of sparse linear least squares (LS) problems. Although we focus our discussion on the algorithm LSQR of Paige and ...
Pavel Jiránek, David Titley-Péloquin
TEC
2010
171views more  TEC 2010»
15 years 1 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
SOFSEM
2000
Springer
15 years 10 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 4 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
SIGSOFT
2010
ACM
15 years 4 months ago
A trace simplification technique for effective debugging of concurrent programs
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
Nicholas Jalbert, Koushik Sen