Sciweavers

17288 search results - page 260 / 3458
» Hybrid Optimizations: Which Optimization Algorithm to Use
Sort
View
INFOCOM
2000
IEEE
15 years 8 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
177
Voted
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
JETAI
2007
141views more  JETAI 2007»
15 years 3 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 10 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
15 years 7 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...