Sciweavers

1291 search results - page 65 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
ISORC
2006
IEEE
14 years 1 months ago
Looking Ahead in Open Multithreaded Transactions
Open multithreaded transactions constitute building blocks that allow a developer to design and structure the execution of complex distributed systems featuring cooperative and co...
Maxime Monod, Jörg Kienzle, Alexander Romanov...
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
14 years 1 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
DCC
2008
IEEE
14 years 7 months ago
Sublinear Recovery of Sparse Wavelet Signals
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
Ray Maleh, Anna C. Gilbert
FOCS
2006
IEEE
14 years 1 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
HPCA
2009
IEEE
14 years 8 months ago
Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
Eiman Ebrahimi, Onur Mutlu, Yale N. Patt